./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_back_harness.i --full-output --preprocessor.use.memory.slicer true --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_back_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bcbdd24aa3539f554995115754c17957131f4a70e9c01f3bd768b3e606eed4d4 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:28:35,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:28:35,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:28:35,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:28:35,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:28:35,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:28:35,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:28:35,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:28:35,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:28:35,953 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:28:35,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:28:35,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:28:35,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:28:35,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:28:35,956 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:28:35,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:28:35,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:28:35,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:28:35,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:28:35,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:28:35,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:28:35,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:28:35,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:28:35,959 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:28:35,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:28:35,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:28:35,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:28:35,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:28:35,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:28:35,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:28:35,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:28:35,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:28:35,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:28:35,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:28:35,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:28:35,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:28:35,963 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:28:35,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:28:35,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:28:35,964 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 -> bcbdd24aa3539f554995115754c17957131f4a70e9c01f3bd768b3e606eed4d4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:28:36,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:28:36,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:28:36,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:28:36,305 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:28:36,306 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:28:36,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_back_harness.i [2023-11-23 07:28:37,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:28:37,999 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:28:37,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_back_harness.i [2023-11-23 07:28:38,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a138d0b2f/df106cc8e39c42f6b67febefda9f091b/FLAG9c79c697e [2023-11-23 07:28:38,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a138d0b2f/df106cc8e39c42f6b67febefda9f091b [2023-11-23 07:28:38,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:28:38,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:28:38,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:28:38,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:28:38,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:28:38,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:28:38" (1/1) ... [2023-11-23 07:28:38,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a6cca38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:38, skipping insertion in model container [2023-11-23 07:28:38,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:28:38" (1/1) ... [2023-11-23 07:28:38,149 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:28:38,412 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_linked_list_pop_back_harness.i[4498,4511] [2023-11-23 07:28:38,420 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_linked_list_pop_back_harness.i[4558,4571] [2023-11-23 07:28:39,131 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,132 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,133 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,133 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,134 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,145 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,146 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,147 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,149 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,151 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,153 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,157 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,157 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,517 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:28:39,519 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:28:39,522 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:28:39,524 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:28:39,528 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:28:39,529 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:28:39,530 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:28:39,532 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:28:39,536 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:28:39,548 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:28:39,728 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:28:39,752 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:28:39,776 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_linked_list_pop_back_harness.i[4498,4511] [2023-11-23 07:28:39,776 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_linked_list_pop_back_harness.i[4558,4571] [2023-11-23 07:28:39,834 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,834 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,835 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,835 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,836 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,847 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,849 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,850 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,850 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,851 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,852 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,852 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,852 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:39,907 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:28:39,908 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:28:39,908 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:28:39,909 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:28:39,909 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:28:39,910 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:28:39,910 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:28:39,912 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:28:39,912 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:28:39,913 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:28:39,955 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:28:40,178 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:40,179 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:40,179 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:40,179 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:40,180 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:40,180 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:40,180 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:40,181 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:40,181 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:40,181 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:40,181 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:40,182 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:40,182 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:40,182 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:40,182 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:40,183 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:40,201 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:28:40,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:40 WrapperNode [2023-11-23 07:28:40,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:28:40,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:28:40,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:28:40,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:28:40,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:40" (1/1) ... [2023-11-23 07:28:40,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:40" (1/1) ... [2023-11-23 07:28:40,356 INFO L138 Inliner]: procedures = 678, calls = 1046, calls flagged for inlining = 52, calls inlined = 8, statements flattened = 224 [2023-11-23 07:28:40,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:28:40,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:28:40,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:28:40,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:28:40,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:40" (1/1) ... [2023-11-23 07:28:40,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:40" (1/1) ... [2023-11-23 07:28:40,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:40" (1/1) ... [2023-11-23 07:28:40,425 INFO L188 MemorySlicer]: Split 43 memory accesses to 4 slices as follows [2, 0, 5, 36]. 84 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5, 0]. The 9 writes are split as follows [0, 0, 0, 9]. [2023-11-23 07:28:40,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:40" (1/1) ... [2023-11-23 07:28:40,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:40" (1/1) ... [2023-11-23 07:28:40,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:40" (1/1) ... [2023-11-23 07:28:40,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:40" (1/1) ... [2023-11-23 07:28:40,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:40" (1/1) ... [2023-11-23 07:28:40,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:40" (1/1) ... [2023-11-23 07:28:40,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:28:40,520 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:28:40,521 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:28:40,521 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:28:40,522 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:40" (1/1) ... [2023-11-23 07:28:40,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:28:40,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:40,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 07:28:40,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 07:28:40,663 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2023-11-23 07:28:40,664 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2023-11-23 07:28:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2023-11-23 07:28:40,664 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2023-11-23 07:28:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:28:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 07:28:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 07:28:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 07:28:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 07:28:40,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:28:40,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:28:40,665 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:28:40,665 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:28:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:28:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 07:28:40,666 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 07:28:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:28:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:28:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:28:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:28:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-23 07:28:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:28:40,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:28:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2023-11-23 07:28:40,667 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2023-11-23 07:28:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-23 07:28:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-23 07:28:40,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-23 07:28:40,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-23 07:28:40,668 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-23 07:28:40,668 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-23 07:28:40,668 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-23 07:28:40,668 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-23 07:28:40,668 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:28:40,668 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:28:40,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:28:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:28:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:28:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:28:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-23 07:28:40,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:28:40,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:28:40,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:28:40,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-23 07:28:40,670 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:28:40,670 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:28:40,670 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:28:40,671 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:28:40,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:28:40,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:28:40,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:28:40,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 07:28:40,976 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:28:40,977 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:28:41,366 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:28:41,410 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:28:41,411 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-23 07:28:41,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:28:41 BoogieIcfgContainer [2023-11-23 07:28:41,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:28:41,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:28:41,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:28:41,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:28:41,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:28:38" (1/3) ... [2023-11-23 07:28:41,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d680dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:28:41, skipping insertion in model container [2023-11-23 07:28:41,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:40" (2/3) ... [2023-11-23 07:28:41,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d680dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:28:41, skipping insertion in model container [2023-11-23 07:28:41,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:28:41" (3/3) ... [2023-11-23 07:28:41,419 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_back_harness.i [2023-11-23 07:28:41,437 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:28:41,437 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:28:41,483 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:28:41,490 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;@53d95125, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:28:41,490 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:28:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-11-23 07:28:41,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 07:28:41,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:41,515 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:41,515 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:41,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:41,522 INFO L85 PathProgramCache]: Analyzing trace with hash 612240928, now seen corresponding path program 1 times [2023-11-23 07:28:41,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:41,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423249972] [2023-11-23 07:28:41,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:41,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:41,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:41,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:28:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:41,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:28:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:41,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:41,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:28:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:41,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:28:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:42,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:42,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:28:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:42,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:28:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:42,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:28:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:42,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:28:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:42,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:28:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:42,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:28:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:42,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:42,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 07:28:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:42,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 07:28:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2023-11-23 07:28:42,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:42,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423249972] [2023-11-23 07:28:42,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423249972] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:42,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280090646] [2023-11-23 07:28:42,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:42,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:42,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:42,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:28:42,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 07:28:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:42,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 07:28:42,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2023-11-23 07:28:42,483 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:28:42,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280090646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:42,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:28:42,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2023-11-23 07:28:42,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84329728] [2023-11-23 07:28:42,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:42,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 07:28:42,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:42,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 07:28:42,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:28:42,517 INFO L87 Difference]: Start difference. First operand has 121 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 07:28:42,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:42,631 INFO L93 Difference]: Finished difference Result 236 states and 371 transitions. [2023-11-23 07:28:42,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 07:28:42,633 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2023-11-23 07:28:42,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:42,645 INFO L225 Difference]: With dead ends: 236 [2023-11-23 07:28:42,645 INFO L226 Difference]: Without dead ends: 119 [2023-11-23 07:28:42,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:28:42,657 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:42,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:28:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-23 07:28:42,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-23 07:28:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 71 states have (on average 1.295774647887324) internal successors, (92), 72 states have internal predecessors, (92), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-23 07:28:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2023-11-23 07:28:42,724 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 110 [2023-11-23 07:28:42,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:42,725 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2023-11-23 07:28:42,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 07:28:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2023-11-23 07:28:42,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 07:28:42,734 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:42,734 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:42,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:42,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-23 07:28:42,951 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:42,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:42,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1810732768, now seen corresponding path program 1 times [2023-11-23 07:28:42,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:42,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863407498] [2023-11-23 07:28:42,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:42,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:28:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:28:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:28:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:28:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:28:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:28:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:28:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:28:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:28:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:28:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 07:28:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 07:28:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2023-11-23 07:28:43,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863407498] [2023-11-23 07:28:43,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863407498] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573439478] [2023-11-23 07:28:43,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:43,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:43,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:43,357 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:28:43,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 07:28:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:43,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 07:28:43,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-23 07:28:43,586 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:28:43,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573439478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:43,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:28:43,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 07:28:43,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309322709] [2023-11-23 07:28:43,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:43,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:28:43,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:43,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:28:43,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:28:43,589 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 07:28:43,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:43,695 INFO L93 Difference]: Finished difference Result 226 states and 319 transitions. [2023-11-23 07:28:43,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:28:43,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 110 [2023-11-23 07:28:43,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:43,702 INFO L225 Difference]: With dead ends: 226 [2023-11-23 07:28:43,702 INFO L226 Difference]: Without dead ends: 123 [2023-11-23 07:28:43,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 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 07:28:43,708 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 3 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:43,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 442 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:28:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-23 07:28:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2023-11-23 07:28:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 75 states have internal predecessors, (95), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-23 07:28:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 168 transitions. [2023-11-23 07:28:43,745 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 168 transitions. Word has length 110 [2023-11-23 07:28:43,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:43,746 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 168 transitions. [2023-11-23 07:28:43,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 07:28:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 168 transitions. [2023-11-23 07:28:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 07:28:43,747 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:43,748 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:43,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:43,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-23 07:28:43,952 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:43,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:43,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1985732642, now seen corresponding path program 1 times [2023-11-23 07:28:43,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:43,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859856760] [2023-11-23 07:28:43,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:43,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:28:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:28:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:28:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:28:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:28:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:28:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:28:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:28:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:28:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:28:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 07:28:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 07:28:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-11-23 07:28:44,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:44,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859856760] [2023-11-23 07:28:44,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859856760] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:44,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851127944] [2023-11-23 07:28:44,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:44,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:44,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:44,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:28:44,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 07:28:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:44,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-23 07:28:44,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:44,899 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 18 treesize of output 19 [2023-11-23 07:28:44,911 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 24 treesize of output 9 [2023-11-23 07:28:44,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:44,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:44,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2023-11-23 07:28:45,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:45,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:45,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:45,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2023-11-23 07:28:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-23 07:28:46,750 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:28:46,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851127944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:46,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:28:46,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2023-11-23 07:28:46,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146015599] [2023-11-23 07:28:46,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:46,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:28:46,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:46,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:28:46,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:28:46,755 INFO L87 Difference]: Start difference. First operand 122 states and 168 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2023-11-23 07:28:48,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:50,477 INFO L93 Difference]: Finished difference Result 320 states and 441 transitions. [2023-11-23 07:28:50,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:28:50,478 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 110 [2023-11-23 07:28:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:50,481 INFO L225 Difference]: With dead ends: 320 [2023-11-23 07:28:50,481 INFO L226 Difference]: Without dead ends: 214 [2023-11-23 07:28:50,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 125 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-11-23 07:28:50,482 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 106 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:50,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 762 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 611 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2023-11-23 07:28:50,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-11-23 07:28:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 207. [2023-11-23 07:28:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 132 states have internal predecessors, (166), 60 states have call successors, (60), 17 states have call predecessors, (60), 17 states have return successors, (61), 57 states have call predecessors, (61), 59 states have call successors, (61) [2023-11-23 07:28:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 287 transitions. [2023-11-23 07:28:50,517 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 287 transitions. Word has length 110 [2023-11-23 07:28:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:50,520 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 287 transitions. [2023-11-23 07:28:50,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2023-11-23 07:28:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 287 transitions. [2023-11-23 07:28:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 07:28:50,522 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:50,522 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:50,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:50,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:50,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:50,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:50,728 INFO L85 PathProgramCache]: Analyzing trace with hash -536541794, now seen corresponding path program 1 times [2023-11-23 07:28:50,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:50,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759326155] [2023-11-23 07:28:50,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:50,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:50,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:50,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:28:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:50,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:28:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:50,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:50,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:28:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:50,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:28:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:50,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:50,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:28:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:50,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:28:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:50,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:28:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:51,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:28:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:51,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:28:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:51,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:28:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:51,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:51,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 07:28:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:51,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 07:28:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-11-23 07:28:51,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:51,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759326155] [2023-11-23 07:28:51,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759326155] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:51,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669178399] [2023-11-23 07:28:51,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:51,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:51,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:51,073 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:28:51,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 07:28:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:51,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-23 07:28:51,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:51,351 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 18 treesize of output 19 [2023-11-23 07:28:51,361 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 24 treesize of output 9 [2023-11-23 07:28:51,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:51,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:51,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2023-11-23 07:28:51,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:51,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:51,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:51,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2023-11-23 07:28:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-23 07:28:52,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:28:52,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669178399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:52,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:28:52,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2023-11-23 07:28:52,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462943298] [2023-11-23 07:28:52,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:52,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:28:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:52,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:28:52,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:28:52,960 INFO L87 Difference]: Start difference. First operand 207 states and 287 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2023-11-23 07:28:55,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:56,130 INFO L93 Difference]: Finished difference Result 360 states and 491 transitions. [2023-11-23 07:28:56,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:28:56,130 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 110 [2023-11-23 07:28:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:56,134 INFO L225 Difference]: With dead ends: 360 [2023-11-23 07:28:56,134 INFO L226 Difference]: Without dead ends: 212 [2023-11-23 07:28:56,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 126 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:28:56,135 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 82 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:56,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 748 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 539 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2023-11-23 07:28:56,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-11-23 07:28:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2023-11-23 07:28:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 132 states have internal predecessors, (166), 60 states have call successors, (60), 17 states have call predecessors, (60), 17 states have return successors, (61), 57 states have call predecessors, (61), 59 states have call successors, (61) [2023-11-23 07:28:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 287 transitions. [2023-11-23 07:28:56,165 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 287 transitions. Word has length 110 [2023-11-23 07:28:56,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:56,166 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 287 transitions. [2023-11-23 07:28:56,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2023-11-23 07:28:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 287 transitions. [2023-11-23 07:28:56,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 07:28:56,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:56,168 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:56,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:56,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:56,384 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:56,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:56,385 INFO L85 PathProgramCache]: Analyzing trace with hash 24157984, now seen corresponding path program 1 times [2023-11-23 07:28:56,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:56,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51956788] [2023-11-23 07:28:56,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:56,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:28:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:28:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:28:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:28:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:28:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:28:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:28:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:28:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:28:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:28:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 07:28:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 07:28:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-11-23 07:28:56,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:56,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51956788] [2023-11-23 07:28:56,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51956788] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:56,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836917588] [2023-11-23 07:28:56,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:56,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:56,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:56,940 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:28:56,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 07:28:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-23 07:28:57,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:57,164 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 24 treesize of output 9 [2023-11-23 07:28:57,171 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 18 treesize of output 19 [2023-11-23 07:28:57,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:57,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:57,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2023-11-23 07:28:57,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:57,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:57,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:57,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2023-11-23 07:29:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-11-23 07:29:00,075 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:29:00,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836917588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:29:00,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:29:00,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2023-11-23 07:29:00,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747857457] [2023-11-23 07:29:00,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:29:00,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 07:29:00,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:29:00,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 07:29:00,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:29:00,077 INFO L87 Difference]: Start difference. First operand 207 states and 287 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2023-11-23 07:29:01,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:29:01,448 INFO L93 Difference]: Finished difference Result 361 states and 490 transitions. [2023-11-23 07:29:01,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 07:29:01,449 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 110 [2023-11-23 07:29:01,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:29:01,450 INFO L225 Difference]: With dead ends: 361 [2023-11-23 07:29:01,451 INFO L226 Difference]: Without dead ends: 211 [2023-11-23 07:29:01,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 112 SyntacticMatches, 20 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2023-11-23 07:29:01,452 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 110 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:29:01,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 718 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 07:29:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-23 07:29:01,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 204. [2023-11-23 07:29:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 126 states have (on average 1.2857142857142858) internal successors, (162), 129 states have internal predecessors, (162), 60 states have call successors, (60), 17 states have call predecessors, (60), 17 states have return successors, (61), 57 states have call predecessors, (61), 59 states have call successors, (61) [2023-11-23 07:29:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 283 transitions. [2023-11-23 07:29:01,477 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 283 transitions. Word has length 110 [2023-11-23 07:29:01,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:29:01,478 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 283 transitions. [2023-11-23 07:29:01,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2023-11-23 07:29:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 283 transitions. [2023-11-23 07:29:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 07:29:01,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:29:01,480 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:29:01,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 07:29:01,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:29:01,693 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:29:01,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:29:01,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1700278176, now seen corresponding path program 1 times [2023-11-23 07:29:01,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:29:01,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101972757] [2023-11-23 07:29:01,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:29:01,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:29:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:01,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:29:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:01,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:29:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:01,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:29:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:01,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:29:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:01,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:29:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:01,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:29:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:01,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:29:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:01,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:29:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:01,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:29:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:01,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:29:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:02,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:29:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:02,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:29:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:02,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:29:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:02,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:29:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:02,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 07:29:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 07:29:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-11-23 07:29:02,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:29:02,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101972757] [2023-11-23 07:29:02,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101972757] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:29:02,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153324862] [2023-11-23 07:29:02,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:29:02,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:29:02,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:29:02,053 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:29:02,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 07:29:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:02,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-23 07:29:02,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:29:02,406 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2023-11-23 07:29:02,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2023-11-23 07:29:02,414 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 16 treesize of output 15 [2023-11-23 07:29:02,461 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:29:02,462 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 16 treesize of output 1 [2023-11-23 07:29:02,513 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:29:02,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2023-11-23 07:29:02,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 07:29:04,595 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#3.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#3.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| (store .cse1 .cse2 .cse0)) .cse0) .cse1))) (<= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| .cse0))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|)))) is different from true [2023-11-23 07:29:04,728 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) .cse2))) (and (or (= .cse0 |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#3.base| .cse0))) (= .cse1 (select (store (store |c_#memory_$Pointer$#3.base| .cse0 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base| (store .cse1 .cse2 .cse0)) .cse0))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#3.base| .cse3))) (= (select (store (store |c_#memory_$Pointer$#3.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| (store .cse4 .cse5 .cse3)) .cse3) .cse4))) (<= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| .cse3))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (<= |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base| .cse0) (<= 2 |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|)))) is different from true [2023-11-23 07:29:17,829 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_16| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16| (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_16| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#3.base| .cse0))) (= .cse1 (select (store (store |c_#memory_$Pointer$#3.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16| (store .cse1 .cse2 .cse0)) .cse0))))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_11| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_11| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|) .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#3.base| .cse3))) (= (select (store (store |c_#memory_$Pointer$#3.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| (store .cse4 .cse5 .cse3)) .cse3) .cse4))) (<= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| .cse3))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#3.base| .cse6))) (= (select (store (store |c_#memory_$Pointer$#3.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| (store .cse7 .cse8 .cse6)) .cse6) .cse7))) (<= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| .cse6))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|))))) is different from true [2023-11-23 07:29:22,416 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_12| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_12| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#3.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#3.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12| (store .cse1 .cse2 .cse0)) .cse0) .cse1)))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_16| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16| (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_16| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#3.base| .cse3))) (= .cse4 (select (store (store |c_#memory_$Pointer$#3.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16| (store .cse4 .cse5 .cse3)) .cse3))))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_11| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_11| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|) .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#3.base| .cse6))) (= (select (store (store |c_#memory_$Pointer$#3.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| (store .cse7 .cse8 .cse6)) .cse6) .cse7))) (<= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| .cse6))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#3.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$#3.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| (store .cse10 .cse11 .cse9)) .cse9) .cse10))) (<= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| .cse9))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|))))) is different from true [2023-11-23 07:29:25,390 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_12| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_12| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#3.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#3.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12| (store .cse1 .cse2 .cse0)) .cse0) .cse1)))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_16| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16| (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_16| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_16| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_16| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#3.base| .cse3))) (= .cse4 (select (store (store |c_#memory_$Pointer$#3.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_16| (store .cse4 .cse5 .cse3)) .cse3))))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_11| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_11| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|) .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#3.base| .cse6))) (= (select (store (store |c_#memory_$Pointer$#3.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| (store .cse7 .cse8 .cse6)) .cse6) .cse7))) (<= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| .cse6))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_15| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|) .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#3.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$#3.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| (store .cse10 .cse11 .cse9)) .cse9) .cse10))) (<= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| .cse9))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_13| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_13| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_13|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_13| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_13|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_13| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_13| 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_13|) .cse14))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_13| .cse12) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$#3.base| .cse12))) (= .cse13 (select (store (store |c_#memory_$Pointer$#3.base| .cse12 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_13| (store .cse13 .cse14 .cse12)) .cse12)))))))))))) is different from true [2023-11-23 07:29:27,405 INFO L349 Elim1Store]: treesize reduction 1088, result has 0.1 percent of original size [2023-11-23 07:29:27,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 23 new quantified variables, introduced 136 case distinctions, treesize of input 487 treesize of output 371 [2023-11-23 07:29:27,418 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 26 treesize of output 14 [2023-11-23 07:29:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 28 not checked. [2023-11-23 07:29:27,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:29:27,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:29:27,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 154 [2023-11-23 07:29:27,820 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 162 treesize of output 146 [2023-11-23 07:29:27,851 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 129 treesize of output 117 [2023-11-23 07:29:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2023-11-23 07:29:30,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153324862] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:29:30,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:29:30,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19, 10] total 31 [2023-11-23 07:29:30,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416388415] [2023-11-23 07:29:30,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:29:30,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-23 07:29:30,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:29:30,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-23 07:29:30,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=540, Unknown=38, NotChecked=260, Total=930 [2023-11-23 07:29:30,115 INFO L87 Difference]: Start difference. First operand 204 states and 283 transitions. Second operand has 31 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 26 states have internal predecessors, (100), 14 states have call successors, (39), 7 states have call predecessors, (39), 10 states have return successors, (38), 13 states have call predecessors, (38), 14 states have call successors, (38) [2023-11-23 07:29:32,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:35,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:38,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:40,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:42,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:44,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:46,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:50,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:54,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:59,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:13,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:32,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:34,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:36,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:38,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:42,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:44,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:46,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:48,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:51,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:53,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:55,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:57,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:59,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:01,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:04,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:06,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:08,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:10,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:13,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:15,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:17,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:20,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:22,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:25,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:27,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:29,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:31,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:33,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:35,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:38,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:40,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:43,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:45,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:47,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:49,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:52,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:54,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 07:31:56,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:58,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:01,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:03,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:05,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:32:06,491 INFO L93 Difference]: Finished difference Result 448 states and 608 transitions. [2023-11-23 07:32:06,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-23 07:32:06,491 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 26 states have internal predecessors, (100), 14 states have call successors, (39), 7 states have call predecessors, (39), 10 states have return successors, (38), 13 states have call predecessors, (38), 14 states have call successors, (38) Word has length 110 [2023-11-23 07:32:06,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:32:06,493 INFO L225 Difference]: With dead ends: 448 [2023-11-23 07:32:06,493 INFO L226 Difference]: Without dead ends: 258 [2023-11-23 07:32:06,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 61.4s TimeCoverageRelationStatistics Valid=262, Invalid=1766, Unknown=62, NotChecked=460, Total=2550 [2023-11-23 07:32:06,495 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 123 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 16 mSolverCounterUnsat, 129 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 119.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 3114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 129 IncrementalHoareTripleChecker+Unknown, 1764 IncrementalHoareTripleChecker+Unchecked, 119.8s IncrementalHoareTripleChecker+Time [2023-11-23 07:32:06,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1758 Invalid, 3114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1205 Invalid, 129 Unknown, 1764 Unchecked, 119.8s Time] [2023-11-23 07:32:06,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-11-23 07:32:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 246. [2023-11-23 07:32:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 158 states have (on average 1.2658227848101267) internal successors, (200), 161 states have internal predecessors, (200), 63 states have call successors, (63), 24 states have call predecessors, (63), 24 states have return successors, (66), 60 states have call predecessors, (66), 62 states have call successors, (66) [2023-11-23 07:32:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 329 transitions. [2023-11-23 07:32:06,529 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 329 transitions. Word has length 110 [2023-11-23 07:32:06,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:32:06,529 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 329 transitions. [2023-11-23 07:32:06,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 26 states have internal predecessors, (100), 14 states have call successors, (39), 7 states have call predecessors, (39), 10 states have return successors, (38), 13 states have call predecessors, (38), 14 states have call successors, (38) [2023-11-23 07:32:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 329 transitions. [2023-11-23 07:32:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 07:32:06,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:32:06,531 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:32:06,545 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 07:32:06,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:32:06,737 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:32:06,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:32:06,737 INFO L85 PathProgramCache]: Analyzing trace with hash -751546471, now seen corresponding path program 1 times [2023-11-23 07:32:06,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:32:06,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921577105] [2023-11-23 07:32:06,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:32:06,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:32:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:06,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:06,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:32:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:06,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:32:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:06,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:06,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:32:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:06,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:32:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:06,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:06,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 07:32:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:06,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 07:32:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:07,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:32:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:07,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:32:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:07,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 07:32:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:07,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 07:32:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:07,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:07,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 07:32:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:07,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 07:32:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2023-11-23 07:32:07,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:32:07,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921577105] [2023-11-23 07:32:07,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921577105] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:32:07,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299245615] [2023-11-23 07:32:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:32:07,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:32:07,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:32:07,080 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 07:32:07,087 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 07:32:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:07,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 07:32:07,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:32:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-23 07:32:07,401 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:32:07,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299245615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:32:07,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:32:07,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2023-11-23 07:32:07,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234576082] [2023-11-23 07:32:07,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:32:07,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:32:07,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:32:07,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:32:07,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:32:07,403 INFO L87 Difference]: Start difference. First operand 246 states and 329 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-23 07:32:07,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:32:07,635 INFO L93 Difference]: Finished difference Result 434 states and 590 transitions. [2023-11-23 07:32:07,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 07:32:07,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 113 [2023-11-23 07:32:07,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:32:07,641 INFO L225 Difference]: With dead ends: 434 [2023-11-23 07:32:07,641 INFO L226 Difference]: Without dead ends: 252 [2023-11-23 07:32:07,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:32:07,647 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 55 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:32:07,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 710 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:32:07,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-11-23 07:32:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 249. [2023-11-23 07:32:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 160 states have (on average 1.25625) internal successors, (201), 164 states have internal predecessors, (201), 63 states have call successors, (63), 24 states have call predecessors, (63), 25 states have return successors, (68), 60 states have call predecessors, (68), 62 states have call successors, (68) [2023-11-23 07:32:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 332 transitions. [2023-11-23 07:32:07,692 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 332 transitions. Word has length 113 [2023-11-23 07:32:07,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:32:07,692 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 332 transitions. [2023-11-23 07:32:07,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-23 07:32:07,692 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 332 transitions. [2023-11-23 07:32:07,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-23 07:32:07,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:32:07,695 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:32:07,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 07:32:07,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:32:07,911 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:32:07,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:32:07,911 INFO L85 PathProgramCache]: Analyzing trace with hash -896320948, now seen corresponding path program 1 times [2023-11-23 07:32:07,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:32:07,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43754446] [2023-11-23 07:32:07,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:32:07,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:32:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:32:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:32:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:32:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:32:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 07:32:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 07:32:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:32:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:32:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-23 07:32:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 07:32:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 07:32:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 07:32:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2023-11-23 07:32:08,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:32:08,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43754446] [2023-11-23 07:32:08,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43754446] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:32:08,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480621938] [2023-11-23 07:32:08,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:32:08,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:32:08,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:32:08,240 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:32:08,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 07:32:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:08,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-23 07:32:08,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:32:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-23 07:32:08,551 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:32:08,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480621938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:32:08,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:32:08,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2023-11-23 07:32:08,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560032779] [2023-11-23 07:32:08,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:32:08,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 07:32:08,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:32:08,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 07:32:08,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:32:08,553 INFO L87 Difference]: Start difference. First operand 249 states and 332 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-23 07:32:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:32:08,869 INFO L93 Difference]: Finished difference Result 462 states and 631 transitions. [2023-11-23 07:32:08,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:32:08,869 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2023-11-23 07:32:08,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:32:08,872 INFO L225 Difference]: With dead ends: 462 [2023-11-23 07:32:08,872 INFO L226 Difference]: Without dead ends: 276 [2023-11-23 07:32:08,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-11-23 07:32:08,874 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 79 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:32:08,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 823 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:32:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-11-23 07:32:08,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 252. [2023-11-23 07:32:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 163 states have (on average 1.2576687116564418) internal successors, (205), 167 states have internal predecessors, (205), 63 states have call successors, (63), 24 states have call predecessors, (63), 25 states have return successors, (68), 60 states have call predecessors, (68), 62 states have call successors, (68) [2023-11-23 07:32:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 336 transitions. [2023-11-23 07:32:08,922 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 336 transitions. Word has length 115 [2023-11-23 07:32:08,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:32:08,923 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 336 transitions. [2023-11-23 07:32:08,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-23 07:32:08,923 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 336 transitions. [2023-11-23 07:32:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-23 07:32:08,925 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:32:08,925 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:32:08,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 07:32:09,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-23 07:32:09,141 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:32:09,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:32:09,142 INFO L85 PathProgramCache]: Analyzing trace with hash -340388564, now seen corresponding path program 1 times [2023-11-23 07:32:09,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:32:09,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710385184] [2023-11-23 07:32:09,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:32:09,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:32:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:32:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:32:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:32:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:32:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 07:32:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 07:32:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:32:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 07:32:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:32:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-23 07:32:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 07:32:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-23 07:32:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-11-23 07:32:09,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:32:09,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710385184] [2023-11-23 07:32:09,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710385184] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:32:09,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495672587] [2023-11-23 07:32:09,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:32:09,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:32:09,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:32:09,510 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:32:09,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 07:32:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:09,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 07:32:09,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:32:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-23 07:32:09,734 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:32:09,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495672587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:32:09,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:32:09,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-23 07:32:09,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572462241] [2023-11-23 07:32:09,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:32:09,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 07:32:09,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:32:09,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 07:32:09,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:32:09,737 INFO L87 Difference]: Start difference. First operand 252 states and 336 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 07:32:09,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:32:09,837 INFO L93 Difference]: Finished difference Result 455 states and 626 transitions. [2023-11-23 07:32:09,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 07:32:09,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2023-11-23 07:32:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:32:09,839 INFO L225 Difference]: With dead ends: 455 [2023-11-23 07:32:09,839 INFO L226 Difference]: Without dead ends: 267 [2023-11-23 07:32:09,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:32:09,845 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 4 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:32:09,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 293 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:32:09,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-11-23 07:32:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2023-11-23 07:32:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 167 states have (on average 1.2574850299401197) internal successors, (210), 171 states have internal predecessors, (210), 63 states have call successors, (63), 24 states have call predecessors, (63), 25 states have return successors, (68), 60 states have call predecessors, (68), 62 states have call successors, (68) [2023-11-23 07:32:09,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 341 transitions. [2023-11-23 07:32:09,887 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 341 transitions. Word has length 116 [2023-11-23 07:32:09,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:32:09,887 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 341 transitions. [2023-11-23 07:32:09,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 07:32:09,888 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 341 transitions. [2023-11-23 07:32:09,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-23 07:32:09,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:32:09,891 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:32:09,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-23 07:32:10,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:32:10,107 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:32:10,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:32:10,107 INFO L85 PathProgramCache]: Analyzing trace with hash -865947473, now seen corresponding path program 1 times [2023-11-23 07:32:10,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:32:10,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74879599] [2023-11-23 07:32:10,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:32:10,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:32:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:32:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:32:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:32:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:32:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 07:32:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 07:32:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:32:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 07:32:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 07:32:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 07:32:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-23 07:32:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-23 07:32:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-23 07:32:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-11-23 07:32:10,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:32:10,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74879599] [2023-11-23 07:32:10,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74879599] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:32:10,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266419426] [2023-11-23 07:32:10,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:32:10,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:32:10,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:32:10,438 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:32:10,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 07:32:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:10,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 127 conjunts are in the unsatisfiable core [2023-11-23 07:32:10,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:32:10,695 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 07:32:10,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:10,919 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 27 treesize of output 15 [2023-11-23 07:32:10,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:10,963 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 27 treesize of output 15 [2023-11-23 07:32:10,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:10,973 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 07:32:11,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:11,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:11,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:11,073 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2023-11-23 07:32:11,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 160 treesize of output 106 [2023-11-23 07:32:11,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:11,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:11,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:11,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 48 [2023-11-23 07:32:14,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:14,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:14,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:14,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:14,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:14,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:14,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:14,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:14,071 INFO L349 Elim1Store]: treesize reduction 244, result has 0.4 percent of original size [2023-11-23 07:32:14,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 10 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 34 case distinctions, treesize of input 206 treesize of output 1 [2023-11-23 07:32:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 110 proven. 17 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-23 07:32:14,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:32:16,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:16,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 6373876 treesize of output 5667773 Killed by 15