./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_end_harness_negated.i --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_end_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bbb8bf94842ca8a2b592a01a3e1f633d5f489747e485942f3148ddc1f5ec733e --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:48:03,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:48:03,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:48:03,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:48:03,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:48:03,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:48:03,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:48:03,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:48:03,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:48:03,358 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:48:03,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:48:03,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:48:03,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:48:03,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:48:03,361 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:48:03,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:48:03,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:48:03,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:48:03,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:48:03,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:48:03,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:48:03,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:48:03,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:48:03,363 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:48:03,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:48:03,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:48:03,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:48:03,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:48:03,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:48:03,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:48:03,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:48:03,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:48:03,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:48:03,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:48:03,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:48:03,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:48:03,366 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:48:03,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:48:03,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:48:03,367 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 -> bbb8bf94842ca8a2b592a01a3e1f633d5f489747e485942f3148ddc1f5ec733e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:48:03,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:48:03,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:48:03,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:48:03,590 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:48:03,590 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:48:03,591 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_end_harness_negated.i [2023-11-23 08:48:04,615 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:48:04,944 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:48:04,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_end_harness_negated.i [2023-11-23 08:48:04,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58818213b/0179e0aab6254999a0ba7b97fa9d3c5c/FLAGd788ac7d4 [2023-11-23 08:48:05,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58818213b/0179e0aab6254999a0ba7b97fa9d3c5c [2023-11-23 08:48:05,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:48:05,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:48:05,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:48:05,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:48:05,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:48:05,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:48:05" (1/1) ... [2023-11-23 08:48:05,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a778c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:05, skipping insertion in model container [2023-11-23 08:48:05,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:48:05" (1/1) ... [2023-11-23 08:48:05,277 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:48:05,474 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_end_harness_negated.i[4493,4506] [2023-11-23 08:48:05,482 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_end_harness_negated.i[4553,4566] [2023-11-23 08:48:06,012 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,013 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,013 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,014 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,014 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,022 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,023 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,024 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,024 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,025 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,026 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,026 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,027 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,202 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:48:06,203 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:48:06,204 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:48:06,205 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:48:06,206 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:48:06,206 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:48:06,206 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:48:06,207 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:48:06,207 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:48:06,208 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:48:06,341 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:48:06,357 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:48:06,373 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_end_harness_negated.i[4493,4506] [2023-11-23 08:48:06,374 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_end_harness_negated.i[4553,4566] [2023-11-23 08:48:06,428 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,429 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,429 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,429 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,430 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,437 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,437 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,438 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,438 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,439 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,439 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,439 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,440 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:06,461 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:48:06,461 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:48:06,462 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:48:06,462 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:48:06,463 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:48:06,463 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:48:06,464 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:48:06,464 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:48:06,464 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:48:06,465 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:48:06,486 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:48:06,598 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:06,598 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:06,598 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:06,598 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:06,598 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:06,598 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:06,598 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:06,598 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:06,599 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:06,599 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:06,599 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:06,599 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:06,599 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:06,599 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:06,599 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:06,599 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:06,605 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:48:06,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06 WrapperNode [2023-11-23 08:48:06,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:48:06,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:48:06,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:48:06,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:48:06,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2023-11-23 08:48:06,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2023-11-23 08:48:06,695 INFO L138 Inliner]: procedures = 678, calls = 1040, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 135 [2023-11-23 08:48:06,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:48:06,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:48:06,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:48:06,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:48:06,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2023-11-23 08:48:06,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2023-11-23 08:48:06,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2023-11-23 08:48:06,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2023-11-23 08:48:06,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2023-11-23 08:48:06,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2023-11-23 08:48:06,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2023-11-23 08:48:06,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2023-11-23 08:48:06,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:48:06,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:48:06,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:48:06,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:48:06,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (1/1) ... [2023-11-23 08:48:06,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:48:06,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:06,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 08:48:06,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 08:48:06,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:48:06,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:48:06,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:48:06,831 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:48:06,831 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:48:06,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:48:06,831 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 08:48:06,831 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 08:48:06,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:48:06,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:48:06,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:48:06,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:48:06,832 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:48:06,832 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:48:06,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:48:06,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:48:06,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:48:06,833 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:48:06,833 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:48:06,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:48:07,048 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:48:07,049 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:48:07,188 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:48:07,217 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:48:07,217 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 08:48:07,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:48:07 BoogieIcfgContainer [2023-11-23 08:48:07,241 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:48:07,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:48:07,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:48:07,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:48:07,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:48:05" (1/3) ... [2023-11-23 08:48:07,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2ee01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:48:07, skipping insertion in model container [2023-11-23 08:48:07,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:06" (2/3) ... [2023-11-23 08:48:07,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2ee01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:48:07, skipping insertion in model container [2023-11-23 08:48:07,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:48:07" (3/3) ... [2023-11-23 08:48:07,247 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_end_harness_negated.i [2023-11-23 08:48:07,260 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:48:07,260 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:48:07,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:48:07,297 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;@373aa9cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:48:07,298 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:48:07,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-23 08:48:07,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:48:07,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:07,311 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:48:07,311 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:07,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:07,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1608602976, now seen corresponding path program 1 times [2023-11-23 08:48:07,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:07,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230197260] [2023-11-23 08:48:07,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:07,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:48:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:48:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:48:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:48:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-23 08:48:07,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:07,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230197260] [2023-11-23 08:48:07,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230197260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:07,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:48:07,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 08:48:07,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577409896] [2023-11-23 08:48:07,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:07,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:48:07,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:07,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:48:07,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:48:07,851 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:07,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:07,901 INFO L93 Difference]: Finished difference Result 112 states and 168 transitions. [2023-11-23 08:48:07,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:48:07,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2023-11-23 08:48:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:07,910 INFO L225 Difference]: With dead ends: 112 [2023-11-23 08:48:07,911 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 08:48:07,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:48:07,917 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:07,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:48:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 08:48:07,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-23 08:48:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 08:48:07,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2023-11-23 08:48:07,959 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 65 [2023-11-23 08:48:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:07,959 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2023-11-23 08:48:07,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:07,965 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2023-11-23 08:48:07,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:48:07,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:07,973 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:48:07,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:48:07,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:07,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:07,978 INFO L85 PathProgramCache]: Analyzing trace with hash 195324314, now seen corresponding path program 1 times [2023-11-23 08:48:07,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:07,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899240221] [2023-11-23 08:48:07,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:07,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:08,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:08,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:08,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:08,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:48:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:08,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:48:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:08,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:48:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:08,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:48:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:48:08,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:08,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899240221] [2023-11-23 08:48:08,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899240221] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:08,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96039060] [2023-11-23 08:48:08,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:08,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:08,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:08,490 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:08,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 08:48:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:08,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-23 08:48:08,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:08,748 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 08:48:08,773 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 08:48:08,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:08,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:08,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:08,859 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 57 treesize of output 25 [2023-11-23 08:48:08,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:08,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:08,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:08,871 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 51 treesize of output 34 [2023-11-23 08:48:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:48:09,723 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:09,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96039060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:09,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:09,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2023-11-23 08:48:09,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894943610] [2023-11-23 08:48:09,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:09,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:48:09,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:09,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:48:09,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:48:09,727 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 08:48:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:10,203 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2023-11-23 08:48:10,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:48:10,204 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2023-11-23 08:48:10,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:10,205 INFO L225 Difference]: With dead ends: 157 [2023-11-23 08:48:10,205 INFO L226 Difference]: Without dead ends: 108 [2023-11-23 08:48:10,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:48:10,206 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 66 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:10,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 330 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:48:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-23 08:48:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2023-11-23 08:48:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 74 states have internal predecessors, (98), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 08:48:10,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2023-11-23 08:48:10,219 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 65 [2023-11-23 08:48:10,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:10,219 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2023-11-23 08:48:10,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 08:48:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2023-11-23 08:48:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:48:10,220 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:10,220 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:48:10,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:10,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:10,434 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:10,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:10,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1693596756, now seen corresponding path program 1 times [2023-11-23 08:48:10,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:10,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187006666] [2023-11-23 08:48:10,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:10,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:48:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:48:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:48:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:48:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:48:10,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:10,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187006666] [2023-11-23 08:48:10,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187006666] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:10,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247885996] [2023-11-23 08:48:10,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:10,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:10,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:10,661 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:10,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 08:48:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:10,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-23 08:48:10,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:10,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2023-11-23 08:48:10,834 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 8 treesize of output 1 [2023-11-23 08:48:10,841 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 20 treesize of output 9 [2023-11-23 08:48:10,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:10,845 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 13 treesize of output 1 [2023-11-23 08:48:12,892 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2 .cse0))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|)))) is different from true [2023-11-23 08:48:13,251 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse1 .cse0) .cse2)) (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8| .cse0))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse3 (select .cse4 .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse4 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse5 .cse3))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|))))) is different from true [2023-11-23 08:48:15,734 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse1 .cse0) .cse2)) (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8| .cse0))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse3 (select .cse4 .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse4 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse5 .cse3))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse8 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|) .cse7 .cse6) .cse8)))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|))))) is different from true [2023-11-23 08:48:16,591 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse1 .cse0) .cse2)) (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8| .cse0))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse3 (select .cse4 .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse4 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse5 .cse3))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_3| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_3| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_3| Int)) (let ((.cse6 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_3| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3|) .cse8 .cse7))) (<= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3| .cse7)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse11 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|)) (.cse10 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse9 (select .cse11 .cse10))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| .cse9) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|) .cse10 .cse9) .cse11)))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|))))) is different from true [2023-11-23 08:48:19,326 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4|) .cse1 .cse0) .cse2)) (<= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4| .cse0))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse4 .cse3) .cse5)) (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8| .cse3))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_8|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse6 (select .cse7 .cse8))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse7 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse8 .cse6))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_7|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_3| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_3| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_3| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3|)) (.cse11 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_3| 24))) (let ((.cse10 (select .cse9 .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3| v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3|) .cse11 .cse10))) (<= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_3| .cse10)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse14 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse12 (select .cse14 .cse13))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| .cse12) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|) .cse13 .cse12) .cse14)))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|))))) is different from true [2023-11-23 08:48:20,898 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 37 not checked. [2023-11-23 08:48:20,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:48:21,357 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2023-11-23 08:48:21,358 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 190 treesize of output 176 [2023-11-23 08:48:21,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:48:21,368 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 65 treesize of output 67 [2023-11-23 08:48:21,373 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 25 treesize of output 21 [2023-11-23 08:48:21,401 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 7 treesize of output 3 [2023-11-23 08:48:21,404 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 50 treesize of output 42 [2023-11-23 08:48:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:48:21,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247885996] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:21,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:48:21,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6, 19] total 31 [2023-11-23 08:48:21,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817519575] [2023-11-23 08:48:21,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:21,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:48:21,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:21,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:48:21,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=571, Unknown=12, NotChecked=260, Total=930 [2023-11-23 08:48:21,575 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:48:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:22,059 INFO L93 Difference]: Finished difference Result 180 states and 255 transitions. [2023-11-23 08:48:22,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:48:22,060 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 08:48:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:22,062 INFO L225 Difference]: With dead ends: 180 [2023-11-23 08:48:22,062 INFO L226 Difference]: Without dead ends: 122 [2023-11-23 08:48:22,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=110, Invalid=768, Unknown=12, NotChecked=300, Total=1190 [2023-11-23 08:48:22,064 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 46 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:22,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 407 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:48:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-23 08:48:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2023-11-23 08:48:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 76 states have internal predecessors, (100), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 08:48:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2023-11-23 08:48:22,078 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 65 [2023-11-23 08:48:22,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:22,079 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2023-11-23 08:48:22,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:48:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2023-11-23 08:48:22,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:48:22,080 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:22,080 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:48:22,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:22,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-23 08:48:22,299 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:22,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1575597938, now seen corresponding path program 1 times [2023-11-23 08:48:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:22,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868430689] [2023-11-23 08:48:22,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:22,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:22,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:22,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:22,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:22,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:48:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:22,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:48:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:22,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:48:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:22,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:48:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:48:22,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:22,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868430689] [2023-11-23 08:48:22,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868430689] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:22,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20915342] [2023-11-23 08:48:22,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:22,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:22,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:22,488 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:22,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 08:48:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:22,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-23 08:48:22,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:22,624 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 08:48:22,633 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 08:48:22,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:22,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:22,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:22,677 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 51 treesize of output 34 [2023-11-23 08:48:22,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:22,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:22,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:22,691 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 57 treesize of output 25 [2023-11-23 08:48:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 08:48:23,710 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:23,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20915342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:23,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:23,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2023-11-23 08:48:23,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341360847] [2023-11-23 08:48:23,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:23,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:48:23,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:23,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:48:23,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:48:23,713 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:48:24,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:24,315 INFO L93 Difference]: Finished difference Result 178 states and 242 transitions. [2023-11-23 08:48:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 08:48:24,316 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 08:48:24,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:24,317 INFO L225 Difference]: With dead ends: 178 [2023-11-23 08:48:24,317 INFO L226 Difference]: Without dead ends: 115 [2023-11-23 08:48:24,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:48:24,318 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 97 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:24,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 383 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:48:24,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-23 08:48:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2023-11-23 08:48:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 78 states have internal predecessors, (102), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 08:48:24,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions. [2023-11-23 08:48:24,327 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 65 [2023-11-23 08:48:24,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:24,328 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 148 transitions. [2023-11-23 08:48:24,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:48:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2023-11-23 08:48:24,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:48:24,329 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:24,329 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:48:24,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:24,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:24,556 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:24,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:24,557 INFO L85 PathProgramCache]: Analyzing trace with hash 644361800, now seen corresponding path program 1 times [2023-11-23 08:48:24,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:24,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323680945] [2023-11-23 08:48:24,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:24,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:24,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:24,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:24,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:24,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:48:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:24,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:48:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:24,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:48:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:24,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:48:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:48:24,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:24,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323680945] [2023-11-23 08:48:24,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323680945] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:24,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113080098] [2023-11-23 08:48:24,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:24,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:24,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:24,956 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:24,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 08:48:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:25,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-23 08:48:25,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:25,130 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 20 treesize of output 9 [2023-11-23 08:48:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:48:27,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:27,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113080098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:27,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:27,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2023-11-23 08:48:27,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474733355] [2023-11-23 08:48:27,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:27,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:48:27,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:27,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:48:27,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-11-23 08:48:27,752 INFO L87 Difference]: Start difference. First operand 110 states and 148 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 08:48:29,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:31,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:33,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:35,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:37,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:38,404 INFO L93 Difference]: Finished difference Result 188 states and 253 transitions. [2023-11-23 08:48:38,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 08:48:38,404 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2023-11-23 08:48:38,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:38,405 INFO L225 Difference]: With dead ends: 188 [2023-11-23 08:48:38,405 INFO L226 Difference]: Without dead ends: 119 [2023-11-23 08:48:38,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2023-11-23 08:48:38,406 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 120 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 24 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:38,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 408 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 302 Invalid, 5 Unknown, 0 Unchecked, 10.6s Time] [2023-11-23 08:48:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-23 08:48:38,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2023-11-23 08:48:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 80 states have internal predecessors, (104), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 08:48:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 150 transitions. [2023-11-23 08:48:38,417 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 150 transitions. Word has length 65 [2023-11-23 08:48:38,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:38,418 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 150 transitions. [2023-11-23 08:48:38,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 08:48:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 150 transitions. [2023-11-23 08:48:38,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:48:38,419 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:38,419 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:48:38,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-23 08:48:38,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:38,627 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:38,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:38,627 INFO L85 PathProgramCache]: Analyzing trace with hash -573076094, now seen corresponding path program 1 times [2023-11-23 08:48:38,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:38,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911175180] [2023-11-23 08:48:38,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:38,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:38,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:38,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:38,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:38,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:48:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:38,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:48:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:38,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:48:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:38,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:48:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:48:38,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:38,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911175180] [2023-11-23 08:48:38,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911175180] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:38,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767417791] [2023-11-23 08:48:38,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:38,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:38,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:38,764 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:38,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 08:48:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:38,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 08:48:38,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:48:38,931 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:38,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767417791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:38,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:38,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-11-23 08:48:38,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770959069] [2023-11-23 08:48:38,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:38,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:48:38,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:38,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:48:38,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:48:38,933 INFO L87 Difference]: Start difference. First operand 112 states and 150 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:38,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:38,974 INFO L93 Difference]: Finished difference Result 241 states and 332 transitions. [2023-11-23 08:48:38,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:48:38,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2023-11-23 08:48:38,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:38,975 INFO L225 Difference]: With dead ends: 241 [2023-11-23 08:48:38,976 INFO L226 Difference]: Without dead ends: 142 [2023-11-23 08:48:38,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:48:38,978 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 19 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:38,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 267 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:48:38,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-23 08:48:39,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-11-23 08:48:39,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 108 states have internal predecessors, (142), 26 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2023-11-23 08:48:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 196 transitions. [2023-11-23 08:48:39,006 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 196 transitions. Word has length 65 [2023-11-23 08:48:39,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:39,006 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 196 transitions. [2023-11-23 08:48:39,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 196 transitions. [2023-11-23 08:48:39,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-23 08:48:39,008 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:39,008 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:48:39,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:39,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:39,216 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:39,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:39,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1603791643, now seen corresponding path program 1 times [2023-11-23 08:48:39,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:39,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804325456] [2023-11-23 08:48:39,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:39,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:39,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:39,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:39,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:48:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:39,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:48:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:39,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:48:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:39,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:48:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:39,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 08:48:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 08:48:39,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:39,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804325456] [2023-11-23 08:48:39,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804325456] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:39,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971721723] [2023-11-23 08:48:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:39,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:39,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:39,415 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:39,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 08:48:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:39,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-23 08:48:39,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:39,591 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 08:48:39,599 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 08:48:39,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:39,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:39,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-23 08:48:39,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:39,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-23 08:48:39,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:39,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:39,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-23 08:48:39,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:39,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-23 08:48:39,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:39,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:39,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:39,766 INFO L349 Elim1Store]: treesize reduction 219, result has 10.6 percent of original size [2023-11-23 08:48:39,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 150 treesize of output 74 [2023-11-23 08:48:39,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:39,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:39,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2023-11-23 08:48:39,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-23 08:48:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:48:40,765 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:48:40,985 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 16))) (and (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_481 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_481))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_485 Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_485)))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2023-11-23 08:48:41,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:48:41,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-23 08:48:41,029 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 16))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 1)) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_15| Int) (v_ArrVal_481 (Array Int Int)) (v_subst_2 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_15|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| v_ArrVal_481))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_2))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| v_arrayElimArr_5))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 1)))))) is different from false [2023-11-23 08:48:41,053 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:48:41,054 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:48:41,112 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 08:48:41,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 297 treesize of output 284 [2023-11-23 08:48:41,123 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:48:41,124 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:48:41,181 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 08:48:41,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 363 treesize of output 350 [2023-11-23 08:48:41,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:48:41,200 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 296 treesize of output 294 [2023-11-23 08:48:41,213 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 253 treesize of output 241 [2023-11-23 08:48:41,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:48:41,231 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 358 treesize of output 330 [2023-11-23 08:48:41,245 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 289 treesize of output 277 [2023-11-23 08:48:41,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 08:48:42,029 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 7 treesize of output 3 [2023-11-23 08:48:42,034 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:48:42,035 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:48:42,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:48:42,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 97 [2023-11-23 08:48:42,135 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 17 treesize of output 9 [2023-11-23 08:48:42,183 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2023-11-23 08:48:42,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971721723] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:48:42,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:48:42,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 23 [2023-11-23 08:48:42,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341262979] [2023-11-23 08:48:42,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:48:42,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-23 08:48:42,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:42,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-23 08:48:42,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=364, Unknown=2, NotChecked=78, Total=506 [2023-11-23 08:48:42,185 INFO L87 Difference]: Start difference. First operand 142 states and 196 transitions. Second operand has 23 states, 20 states have (on average 4.5) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2023-11-23 08:48:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:43,608 INFO L93 Difference]: Finished difference Result 297 states and 429 transitions. [2023-11-23 08:48:43,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-23 08:48:43,609 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 4.5) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) Word has length 66 [2023-11-23 08:48:43,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:43,610 INFO L225 Difference]: With dead ends: 297 [2023-11-23 08:48:43,610 INFO L226 Difference]: Without dead ends: 228 [2023-11-23 08:48:43,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=154, Invalid=1042, Unknown=2, NotChecked=134, Total=1332 [2023-11-23 08:48:43,612 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 102 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 335 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:43,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 993 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 817 Invalid, 0 Unknown, 335 Unchecked, 0.9s Time] [2023-11-23 08:48:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-11-23 08:48:43,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 212. [2023-11-23 08:48:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 155 states have (on average 1.3806451612903226) internal successors, (214), 163 states have internal predecessors, (214), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2023-11-23 08:48:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 299 transitions. [2023-11-23 08:48:43,635 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 299 transitions. Word has length 66 [2023-11-23 08:48:43,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:43,635 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 299 transitions. [2023-11-23 08:48:43,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 4.5) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2023-11-23 08:48:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2023-11-23 08:48:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 08:48:43,637 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:43,638 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:43,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:43,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:43,844 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:43,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:43,845 INFO L85 PathProgramCache]: Analyzing trace with hash -881488954, now seen corresponding path program 1 times [2023-11-23 08:48:43,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:43,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304755626] [2023-11-23 08:48:43,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:43,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:43,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:43,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:43,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:48:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:43,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 08:48:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:43,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:48:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:43,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:48:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:48:43,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:43,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304755626] [2023-11-23 08:48:43,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304755626] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:43,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004322080] [2023-11-23 08:48:43,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:43,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:43,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:43,986 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:44,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 08:48:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:44,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 08:48:44,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:48:44,166 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:44,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004322080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:44,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:44,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 08:48:44,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139317793] [2023-11-23 08:48:44,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:44,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:48:44,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:44,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:48:44,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:48:44,168 INFO L87 Difference]: Start difference. First operand 212 states and 299 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:44,258 INFO L93 Difference]: Finished difference Result 426 states and 605 transitions. [2023-11-23 08:48:44,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:48:44,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2023-11-23 08:48:44,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:44,260 INFO L225 Difference]: With dead ends: 426 [2023-11-23 08:48:44,264 INFO L226 Difference]: Without dead ends: 230 [2023-11-23 08:48:44,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:48:44,267 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 32 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:44,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 232 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:48:44,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-23 08:48:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 212. [2023-11-23 08:48:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 155 states have (on average 1.3806451612903226) internal successors, (214), 163 states have internal predecessors, (214), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2023-11-23 08:48:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 299 transitions. [2023-11-23 08:48:44,288 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 299 transitions. Word has length 67 [2023-11-23 08:48:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:44,288 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 299 transitions. [2023-11-23 08:48:44,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2023-11-23 08:48:44,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 08:48:44,290 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:44,290 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:44,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:44,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:44,503 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:44,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:44,503 INFO L85 PathProgramCache]: Analyzing trace with hash 137468019, now seen corresponding path program 1 times [2023-11-23 08:48:44,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:44,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874559287] [2023-11-23 08:48:44,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:44,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:44,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:44,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:44,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:44,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:48:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:44,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:48:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:44,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:48:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:44,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:48:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:48:44,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:44,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874559287] [2023-11-23 08:48:44,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874559287] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:44,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760818607] [2023-11-23 08:48:44,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:44,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:44,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:44,628 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:44,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 08:48:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:44,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:48:44,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:48:44,813 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:44,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760818607] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:44,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:44,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2023-11-23 08:48:44,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545569343] [2023-11-23 08:48:44,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:44,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:48:44,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:44,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:48:44,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:48:44,816 INFO L87 Difference]: Start difference. First operand 212 states and 299 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:44,959 INFO L93 Difference]: Finished difference Result 471 states and 674 transitions. [2023-11-23 08:48:44,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:48:44,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2023-11-23 08:48:44,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:44,962 INFO L225 Difference]: With dead ends: 471 [2023-11-23 08:48:44,962 INFO L226 Difference]: Without dead ends: 275 [2023-11-23 08:48:44,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:48:44,964 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 56 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:44,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 273 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:48:44,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-11-23 08:48:45,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 215. [2023-11-23 08:48:45,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 158 states have (on average 1.3924050632911393) internal successors, (220), 166 states have internal predecessors, (220), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2023-11-23 08:48:45,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 305 transitions. [2023-11-23 08:48:45,009 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 305 transitions. Word has length 69 [2023-11-23 08:48:45,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:45,009 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 305 transitions. [2023-11-23 08:48:45,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 305 transitions. [2023-11-23 08:48:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:48:45,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:45,011 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:45,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:45,212 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,SelfDestructingSolverStorable8 [2023-11-23 08:48:45,212 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:45,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:45,213 INFO L85 PathProgramCache]: Analyzing trace with hash 169140427, now seen corresponding path program 1 times [2023-11-23 08:48:45,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:45,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447414621] [2023-11-23 08:48:45,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:45,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:48:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:48:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:48:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 08:48:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 08:48:45,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:45,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447414621] [2023-11-23 08:48:45,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447414621] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:45,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101088990] [2023-11-23 08:48:45,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:45,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:45,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:45,335 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:45,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 08:48:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 08:48:45,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 08:48:45,469 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:45,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101088990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:45,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:45,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-23 08:48:45,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994880724] [2023-11-23 08:48:45,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:45,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 08:48:45,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:45,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 08:48:45,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:48:45,470 INFO L87 Difference]: Start difference. First operand 215 states and 305 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:45,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:45,507 INFO L93 Difference]: Finished difference Result 444 states and 656 transitions. [2023-11-23 08:48:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 08:48:45,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2023-11-23 08:48:45,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:45,509 INFO L225 Difference]: With dead ends: 444 [2023-11-23 08:48:45,509 INFO L226 Difference]: Without dead ends: 245 [2023-11-23 08:48:45,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:48:45,510 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:45,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:48:45,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-11-23 08:48:45,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 224. [2023-11-23 08:48:45,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 167 states have (on average 1.3892215568862276) internal successors, (232), 175 states have internal predecessors, (232), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2023-11-23 08:48:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 317 transitions. [2023-11-23 08:48:45,525 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 317 transitions. Word has length 70 [2023-11-23 08:48:45,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:45,525 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 317 transitions. [2023-11-23 08:48:45,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 317 transitions. [2023-11-23 08:48:45,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 08:48:45,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:45,526 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:45,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:45,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 08:48:45,738 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:45,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:45,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1815246183, now seen corresponding path program 1 times [2023-11-23 08:48:45,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:45,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888888211] [2023-11-23 08:48:45,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:45,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:48:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:48:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:48:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:48:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:45,927 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:48:45,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:45,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888888211] [2023-11-23 08:48:45,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888888211] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:45,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920376055] [2023-11-23 08:48:45,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:45,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:45,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:45,929 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:45,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 08:48:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:48:46,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:48:46,116 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:46,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920376055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:46,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:46,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 08:48:46,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033107982] [2023-11-23 08:48:46,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:46,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:48:46,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:46,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:48:46,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:48:46,118 INFO L87 Difference]: Start difference. First operand 224 states and 317 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:48:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:46,181 INFO L93 Difference]: Finished difference Result 435 states and 606 transitions. [2023-11-23 08:48:46,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:48:46,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 77 [2023-11-23 08:48:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:46,183 INFO L225 Difference]: With dead ends: 435 [2023-11-23 08:48:46,183 INFO L226 Difference]: Without dead ends: 176 [2023-11-23 08:48:46,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:48:46,185 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 21 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:46,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 355 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:48:46,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-11-23 08:48:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2023-11-23 08:48:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 130 states have internal predecessors, (157), 35 states have call successors, (35), 13 states have call predecessors, (35), 18 states have return successors, (44), 32 states have call predecessors, (44), 32 states have call successors, (44) [2023-11-23 08:48:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 236 transitions. [2023-11-23 08:48:46,198 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 236 transitions. Word has length 77 [2023-11-23 08:48:46,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:46,198 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 236 transitions. [2023-11-23 08:48:46,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:48:46,198 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 236 transitions. [2023-11-23 08:48:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-23 08:48:46,199 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:46,199 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:48:46,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:46,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 08:48:46,412 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:46,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:46,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1423777218, now seen corresponding path program 1 times [2023-11-23 08:48:46,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:46,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730263113] [2023-11-23 08:48:46,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:46,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:48:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:48:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:48:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:48:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:48:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 08:48:46,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:46,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730263113] [2023-11-23 08:48:46,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730263113] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:46,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492476525] [2023-11-23 08:48:46,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:46,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:46,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:46,642 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:46,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 08:48:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:46,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-23 08:48:46,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:46,842 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 13 treesize of output 9 [2023-11-23 08:48:46,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:46,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2023-11-23 08:48:46,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2023-11-23 08:48:46,868 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 8 treesize of output 1 [2023-11-23 08:48:46,918 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|) .cse1 .cse0) .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| 0)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|)))) is different from true [2023-11-23 08:48:47,088 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|) .cse1 .cse0) .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| 0)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|)))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 24))) (let ((.cse3 (select .cse5 .cse4))) (or (and (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| .cse3) (not (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| 0))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse4 .cse3) .cse5)) (not (= .cse3 0))))))) is different from true [2023-11-23 08:48:47,112 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|) .cse1 .cse0) .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| 0)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (not (= .cse3 0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|) .cse4 .cse3) .cse5)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| 0)))))) is different from true [2023-11-23 08:48:47,186 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|) .cse1 .cse0) .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| 0)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (not (= .cse3 0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|) .cse4 .cse3) .cse5)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| 0))))) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 24))) (let ((.cse6 (select .cse8 .cse7))) (or (and (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| .cse6) (not (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| 0))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse7 .cse6) .cse8)) (not (= .cse6 0))))))) is different from true [2023-11-23 08:48:47,217 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|) .cse1 .cse0) .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| 0)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (not (= .cse3 0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|) .cse4 .cse3) .cse5)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| 0))))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|)) (.cse8 (+ |c_ULTIMATE.start_aws_linked_list_end_~list#1.offset| 24))) (let ((.cse6 (select .cse7 .cse8))) (or (and (not (= |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| 0)) (= .cse6 |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|)) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= .cse7 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_4) |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|) .cse8 .cse6))) (not (= .cse6 0))))))) is different from true [2023-11-23 08:48:47,245 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|) .cse1 .cse0) .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| 0)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (not (= .cse3 0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|) .cse4 .cse3) .cse5)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| 0))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse6 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_15|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_15| v_DerPreprocessor_3) .cse7 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_15|) .cse8 .cse7))) (not (= .cse7 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_15| 0)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_15| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_14| 24))))))) is different from true [2023-11-23 08:48:47,718 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|) .cse1 .cse0) .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| 0)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (not (= .cse3 0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|) .cse4 .cse3) .cse5)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_32| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_45| 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 0) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse6 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_15|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse7 (select .cse6 .cse8))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_15| v_DerPreprocessor_3) .cse7 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_15|) .cse8 .cse7))) (not (= .cse7 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_15| 0)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_15| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_14| 24))))))) is different from true [2023-11-23 08:48:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-23 08:48:47,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:48:48,053 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2023-11-23 08:48:48,053 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 185 [2023-11-23 08:48:48,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:48:48,061 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 95 treesize of output 97 [2023-11-23 08:48:48,065 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 68 treesize of output 64 [2023-11-23 08:48:48,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 08:48:48,093 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 22 treesize of output 18 [2023-11-23 08:48:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:48:48,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492476525] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:48:48,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:48:48,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 10] total 26 [2023-11-23 08:48:48,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007925050] [2023-11-23 08:48:48,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:48:48,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 08:48:48,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:48,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 08:48:48,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=283, Unknown=30, NotChecked=280, Total=650 [2023-11-23 08:48:48,115 INFO L87 Difference]: Start difference. First operand 176 states and 236 transitions. Second operand has 26 states, 21 states have (on average 5.142857142857143) internal successors, (108), 22 states have internal predecessors, (108), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-23 08:48:50,166 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_aws_linked_list_end_harness_#t~ret683#1| 0) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|) .cse1 .cse0) .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44| 0)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_31| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_44|)))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 24))) (let ((.cse3 (select .cse5 .cse4))) (or (and (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| .cse3) (not (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| 0))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse4 .cse3) .cse5)) (not (= .cse3 0))))))) is different from true [2023-11-23 08:48:50,337 WARN L876 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|) (+ |c_ULTIMATE.start_aws_linked_list_end_~list#1.offset| 24)) 0)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 24))) (let ((.cse0 (select .cse2 .cse1))) (or (and (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| .cse0) (not (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| 0))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse1 .cse0) .cse2)) (not (= .cse0 0))))))) is different from true [2023-11-23 08:48:50,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:50,480 INFO L93 Difference]: Finished difference Result 466 states and 649 transitions. [2023-11-23 08:48:50,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-23 08:48:50,481 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 5.142857142857143) internal successors, (108), 22 states have internal predecessors, (108), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) Word has length 78 [2023-11-23 08:48:50,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:50,482 INFO L225 Difference]: With dead ends: 466 [2023-11-23 08:48:50,482 INFO L226 Difference]: Without dead ends: 288 [2023-11-23 08:48:50,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=176, Invalid=1045, Unknown=75, NotChecked=684, Total=1980 [2023-11-23 08:48:50,484 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 70 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 7 mSolverCounterUnsat, 66 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 2184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 66 IncrementalHoareTripleChecker+Unknown, 1374 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:50,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 946 Invalid, 2184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 737 Invalid, 66 Unknown, 1374 Unchecked, 1.4s Time] [2023-11-23 08:48:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-11-23 08:48:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 257. [2023-11-23 08:48:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 192 states have (on average 1.3333333333333333) internal successors, (256), 203 states have internal predecessors, (256), 39 states have call successors, (39), 17 states have call predecessors, (39), 25 states have return successors, (59), 36 states have call predecessors, (59), 36 states have call successors, (59) [2023-11-23 08:48:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 354 transitions. [2023-11-23 08:48:50,500 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 354 transitions. Word has length 78 [2023-11-23 08:48:50,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:50,500 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 354 transitions. [2023-11-23 08:48:50,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 5.142857142857143) internal successors, (108), 22 states have internal predecessors, (108), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-23 08:48:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 354 transitions. [2023-11-23 08:48:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:48:50,501 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:50,501 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:48:50,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:50,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-23 08:48:50,712 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:50,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:50,713 INFO L85 PathProgramCache]: Analyzing trace with hash 112431785, now seen corresponding path program 1 times [2023-11-23 08:48:50,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:50,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665479736] [2023-11-23 08:48:50,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:50,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:50,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:50,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:50,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:48:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:51,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:51,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:48:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:51,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:48:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:51,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:48:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:51,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:48:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 08:48:51,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:51,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665479736] [2023-11-23 08:48:51,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665479736] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:51,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204592044] [2023-11-23 08:48:51,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:51,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:51,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:51,049 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:51,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-23 08:48:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:51,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-23 08:48:51,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:51,265 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 08:48:51,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:51,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 08:48:51,304 INFO L349 Elim1Store]: treesize reduction 68, result has 9.3 percent of original size [2023-11-23 08:48:51,304 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 29 [2023-11-23 08:48:53,344 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_39| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_52|))) (let ((.cse0 (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_39| 24)))) (and (not (= .cse0 0)) (= .cse0 (select .cse1 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_39|)) (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_52|))))) is different from true [2023-11-23 08:48:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:48:53,660 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:48:55,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:48:55,969 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 39 [2023-11-23 08:48:55,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:48:55,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 332 treesize of output 306 [2023-11-23 08:48:55,991 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 284 treesize of output 276 [2023-11-23 08:48:56,073 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 24 [2023-11-23 08:48:56,077 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 6 treesize of output 4 [2023-11-23 08:48:56,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:48:56,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 93 [2023-11-23 08:48:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:48:56,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204592044] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:48:56,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:48:56,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 11] total 27 [2023-11-23 08:48:56,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266003271] [2023-11-23 08:48:56,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:48:56,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-23 08:48:56,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:56,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-23 08:48:56,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=579, Unknown=2, NotChecked=48, Total=702 [2023-11-23 08:48:56,265 INFO L87 Difference]: Start difference. First operand 257 states and 354 transitions. Second operand has 27 states, 25 states have (on average 4.44) internal successors, (111), 27 states have internal predecessors, (111), 9 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) [2023-11-23 08:48:58,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:01,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:03,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:05,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:07,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:09,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:10,547 INFO L93 Difference]: Finished difference Result 805 states and 1169 transitions. [2023-11-23 08:49:10,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-23 08:49:10,548 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 4.44) internal successors, (111), 27 states have internal predecessors, (111), 9 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) Word has length 80 [2023-11-23 08:49:10,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:10,550 INFO L225 Difference]: With dead ends: 805 [2023-11-23 08:49:10,550 INFO L226 Difference]: Without dead ends: 518 [2023-11-23 08:49:10,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=469, Invalid=2613, Unknown=2, NotChecked=108, Total=3192 [2023-11-23 08:49:10,552 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 383 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 76 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 527 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:10,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 978 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1393 Invalid, 6 Unknown, 527 Unchecked, 13.2s Time] [2023-11-23 08:49:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2023-11-23 08:49:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 355. [2023-11-23 08:49:10,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 274 states have (on average 1.3394160583941606) internal successors, (367), 287 states have internal predecessors, (367), 53 states have call successors, (53), 18 states have call predecessors, (53), 27 states have return successors, (76), 49 states have call predecessors, (76), 50 states have call successors, (76) [2023-11-23 08:49:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 496 transitions. [2023-11-23 08:49:10,586 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 496 transitions. Word has length 80 [2023-11-23 08:49:10,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:10,587 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 496 transitions. [2023-11-23 08:49:10,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 4.44) internal successors, (111), 27 states have internal predecessors, (111), 9 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) [2023-11-23 08:49:10,588 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 496 transitions. [2023-11-23 08:49:10,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 08:49:10,589 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:10,589 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:49:10,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-23 08:49:10,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 08:49:10,801 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:10,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash -294787671, now seen corresponding path program 1 times [2023-11-23 08:49:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:10,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405630037] [2023-11-23 08:49:10,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:10,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:10,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:10,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:49:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:10,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:49:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:10,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:49:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:10,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 08:49:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:10,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:49:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:10,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:49:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:11,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 08:49:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-23 08:49:11,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:11,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405630037] [2023-11-23 08:49:11,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405630037] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:49:11,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543762306] [2023-11-23 08:49:11,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:11,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:49:11,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:49:11,012 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:49:11,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-23 08:49:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:11,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 81 conjunts are in the unsatisfiable core [2023-11-23 08:49:11,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:49:11,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:49:11,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-23 08:49:11,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:49:11,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 21 [2023-11-23 08:49:11,258 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 12 treesize of output 1 [2023-11-23 08:49:11,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:49:11,261 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 21 treesize of output 1 [2023-11-23 08:49:13,275 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_58| Int)) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_58|) 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_58|)) is different from true [2023-11-23 08:49:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:49:25,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:49:34,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543762306] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:49:34,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:49:34,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 17] total 21 [2023-11-23 08:49:34,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350553667] [2023-11-23 08:49:34,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:49:34,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-23 08:49:34,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:34,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-23 08:49:34,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=584, Unknown=11, NotChecked=48, Total=702 [2023-11-23 08:49:34,326 INFO L87 Difference]: Start difference. First operand 355 states and 496 transitions. Second operand has 21 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 6 states have call successors, (17), 3 states have call predecessors, (17), 6 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-23 08:49:36,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:40,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:42,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:46,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:48,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:50,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:52,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:54,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:56,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:49:58,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:00,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:02,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:05,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:07,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:09,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:09,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:09,810 INFO L93 Difference]: Finished difference Result 689 states and 962 transitions. [2023-11-23 08:50:09,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-23 08:50:09,811 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 6 states have call successors, (17), 3 states have call predecessors, (17), 6 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 81 [2023-11-23 08:50:09,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:09,813 INFO L225 Difference]: With dead ends: 689 [2023-11-23 08:50:09,813 INFO L226 Difference]: Without dead ends: 417 [2023-11-23 08:50:09,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=132, Invalid=1341, Unknown=13, NotChecked=74, Total=1560 [2023-11-23 08:50:09,842 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 67 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 7 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 31.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:09,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 962 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 881 Invalid, 15 Unknown, 192 Unchecked, 31.0s Time] [2023-11-23 08:50:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-11-23 08:50:09,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 330. [2023-11-23 08:50:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 254 states have (on average 1.3346456692913387) internal successors, (339), 265 states have internal predecessors, (339), 50 states have call successors, (50), 17 states have call predecessors, (50), 25 states have return successors, (62), 47 states have call predecessors, (62), 47 states have call successors, (62) [2023-11-23 08:50:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 451 transitions. [2023-11-23 08:50:09,875 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 451 transitions. Word has length 81 [2023-11-23 08:50:09,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:09,875 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 451 transitions. [2023-11-23 08:50:09,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 6 states have call successors, (17), 3 states have call predecessors, (17), 6 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-23 08:50:09,875 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 451 transitions. [2023-11-23 08:50:09,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-23 08:50:09,876 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:09,876 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-11-23 08:50:09,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-23 08:50:10,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 08:50:10,094 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:10,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:10,094 INFO L85 PathProgramCache]: Analyzing trace with hash 554649810, now seen corresponding path program 1 times [2023-11-23 08:50:10,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:10,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557637299] [2023-11-23 08:50:10,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:10,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:10,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:10,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:10,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:50:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:10,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:50:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:10,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:50:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:10,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:50:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:10,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 08:50:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:10,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 08:50:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-23 08:50:10,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:10,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557637299] [2023-11-23 08:50:10,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557637299] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:10,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231172062] [2023-11-23 08:50:10,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:10,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:10,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:10,252 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:50:10,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-23 08:50:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:10,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 08:50:10,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 08:50:10,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:50:10,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231172062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:10,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:50:10,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2023-11-23 08:50:10,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719577788] [2023-11-23 08:50:10,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:10,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:50:10,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:10,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:50:10,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:50:10,496 INFO L87 Difference]: Start difference. First operand 330 states and 451 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:50:10,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:10,646 INFO L93 Difference]: Finished difference Result 583 states and 796 transitions. [2023-11-23 08:50:10,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:50:10,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 84 [2023-11-23 08:50:10,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:10,648 INFO L225 Difference]: With dead ends: 583 [2023-11-23 08:50:10,648 INFO L226 Difference]: Without dead ends: 327 [2023-11-23 08:50:10,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 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 08:50:10,651 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 34 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:10,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 271 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:50:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-11-23 08:50:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2023-11-23 08:50:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 252 states have (on average 1.3015873015873016) internal successors, (328), 262 states have internal predecessors, (328), 50 states have call successors, (50), 17 states have call predecessors, (50), 24 states have return successors, (60), 47 states have call predecessors, (60), 47 states have call successors, (60) [2023-11-23 08:50:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 438 transitions. [2023-11-23 08:50:10,698 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 438 transitions. Word has length 84 [2023-11-23 08:50:10,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:10,699 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 438 transitions. [2023-11-23 08:50:10,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:50:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 438 transitions. [2023-11-23 08:50:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-23 08:50:10,701 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:10,701 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:50:10,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-23 08:50:10,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:10,913 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:10,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:10,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1816618516, now seen corresponding path program 1 times [2023-11-23 08:50:10,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:10,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923670808] [2023-11-23 08:50:10,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:10,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:11,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:11,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:11,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:50:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:11,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:50:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:11,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:50:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:11,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:50:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:11,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:50:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:11,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:50:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:11,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:50:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:11,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:50:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-23 08:50:11,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:11,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923670808] [2023-11-23 08:50:11,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923670808] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:11,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040256659] [2023-11-23 08:50:11,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:11,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:11,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:11,124 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:50:11,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-23 08:50:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:11,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 148 conjunts are in the unsatisfiable core [2023-11-23 08:50:11,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:11,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-23 08:50:11,386 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 14 treesize of output 15 [2023-11-23 08:50:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 22 proven. 23 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-23 08:50:13,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:50:18,816 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:50:18,965 INFO L349 Elim1Store]: treesize reduction 321, result has 47.3 percent of original size [2023-11-23 08:50:18,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 4912 treesize of output 3820 [2023-11-23 08:50:19,450 INFO L349 Elim1Store]: treesize reduction 434, result has 41.3 percent of original size [2023-11-23 08:50:19,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 4135 treesize of output 4029 [2023-11-23 08:50:19,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:50:19,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1725 treesize of output 1697 [2023-11-23 08:50:19,829 INFO L349 Elim1Store]: treesize reduction 24, result has 80.2 percent of original size [2023-11-23 08:50:19,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 1997 treesize of output 1928 [2023-11-23 08:50:21,526 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 6 treesize of output 4 [2023-11-23 08:50:43,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:50:43,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2023-11-23 08:50:43,255 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 6 treesize of output 4 [2023-11-23 08:50:43,588 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 6 treesize of output 4 [2023-11-23 08:50:43,949 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 6 treesize of output 4 [2023-11-23 08:50:44,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:50:44,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 83 [2023-11-23 08:50:44,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:50:44,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2023-11-23 08:50:44,834 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 6 treesize of output 4 [2023-11-23 08:50:44,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:50:44,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 80 [2023-11-23 08:50:44,906 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 08:50:44,915 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 08:50:45,071 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 29 proven. 41 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 08:50:45,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040256659] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:50:45,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:50:45,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 23, 25] total 51 [2023-11-23 08:50:45,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520423821] [2023-11-23 08:50:45,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:50:45,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-23 08:50:45,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:45,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-23 08:50:45,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2358, Unknown=2, NotChecked=0, Total=2550 [2023-11-23 08:50:45,074 INFO L87 Difference]: Start difference. First operand 327 states and 438 transitions. Second operand has 51 states, 45 states have (on average 3.1555555555555554) internal successors, (142), 45 states have internal predecessors, (142), 15 states have call successors, (27), 3 states have call predecessors, (27), 12 states have return successors, (27), 16 states have call predecessors, (27), 15 states have call successors, (27) [2023-11-23 08:50:49,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-23 08:51:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:51:29,399 INFO L93 Difference]: Finished difference Result 686 states and 950 transitions. [2023-11-23 08:51:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-23 08:51:29,400 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 45 states have (on average 3.1555555555555554) internal successors, (142), 45 states have internal predecessors, (142), 15 states have call successors, (27), 3 states have call predecessors, (27), 12 states have return successors, (27), 16 states have call predecessors, (27), 15 states have call successors, (27) Word has length 104 [2023-11-23 08:51:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:51:29,403 INFO L225 Difference]: With dead ends: 686 [2023-11-23 08:51:29,403 INFO L226 Difference]: Without dead ends: 452 [2023-11-23 08:51:29,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 186 SyntacticMatches, 7 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2466 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=1065, Invalid=8833, Unknown=2, NotChecked=0, Total=9900 [2023-11-23 08:51:29,406 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 358 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 2621 mSolverCounterSat, 121 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 2743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2621 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:51:29,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1817 Invalid, 2743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2621 Invalid, 1 Unknown, 0 Unchecked, 19.1s Time] [2023-11-23 08:51:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2023-11-23 08:51:29,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 330. [2023-11-23 08:51:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 254 states have (on average 1.2992125984251968) internal successors, (330), 264 states have internal predecessors, (330), 50 states have call successors, (50), 17 states have call predecessors, (50), 25 states have return successors, (61), 48 states have call predecessors, (61), 47 states have call successors, (61) [2023-11-23 08:51:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 441 transitions. [2023-11-23 08:51:29,449 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 441 transitions. Word has length 104 [2023-11-23 08:51:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:51:29,449 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 441 transitions. [2023-11-23 08:51:29,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 45 states have (on average 3.1555555555555554) internal successors, (142), 45 states have internal predecessors, (142), 15 states have call successors, (27), 3 states have call predecessors, (27), 12 states have return successors, (27), 16 states have call predecessors, (27), 15 states have call successors, (27) [2023-11-23 08:51:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 441 transitions. [2023-11-23 08:51:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 08:51:29,451 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:51:29,451 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:51:29,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-23 08:51:29,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-23 08:51:29,663 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:51:29,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:51:29,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1485531093, now seen corresponding path program 1 times [2023-11-23 08:51:29,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:51:29,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673106141] [2023-11-23 08:51:29,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:51:29,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:51:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:30,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:51:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:30,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:51:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:30,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:51:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:30,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:51:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:30,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:51:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:30,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:51:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:31,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:51:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:32,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:51:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:32,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:51:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:32,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:51:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:32,408 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 5 proven. 59 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-23 08:51:32,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:51:32,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673106141] [2023-11-23 08:51:32,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673106141] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:51:32,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349254194] [2023-11-23 08:51:32,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:51:32,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:51:32,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:51:32,410 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:51:32,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-23 08:51:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:32,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-23 08:51:32,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:51:33,518 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 20 treesize of output 9 [2023-11-23 08:51:52,298 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2023-11-23 08:51:52,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 16 [2023-11-23 08:51:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:51:52,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:51:58,797 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-23 08:51:58,797 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 88 [2023-11-23 08:51:58,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:51:58,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 103 [2023-11-23 08:51:59,000 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 29 treesize of output 27 [2023-11-23 08:51:59,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 08:51:59,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 08:51:59,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:51:59,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2023-11-23 08:52:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 23 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 08:52:01,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349254194] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:52:01,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:52:01,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 41 [2023-11-23 08:52:01,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234193608] [2023-11-23 08:52:01,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:52:01,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-23 08:52:01,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:01,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-23 08:52:01,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1492, Unknown=1, NotChecked=0, Total=1640 [2023-11-23 08:52:01,325 INFO L87 Difference]: Start difference. First operand 330 states and 441 transitions. Second operand has 41 states, 38 states have (on average 4.631578947368421) internal successors, (176), 40 states have internal predecessors, (176), 16 states have call successors, (27), 3 states have call predecessors, (27), 10 states have return successors, (26), 13 states have call predecessors, (26), 16 states have call successors, (26) [2023-11-23 08:52:03,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:05,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:07,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:10,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:12,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:15,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:17,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:19,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:22,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:28,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15