./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness.i --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 61592663790a1842b8bd7e9befeca1c276604b90aee8701db027349608c78395 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:48:24,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:48:25,037 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:25,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:48:25,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:48:25,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:48:25,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:48:25,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:48:25,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:48:25,079 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:48:25,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:48:25,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:48:25,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:48:25,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:48:25,082 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:48:25,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:48:25,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:48:25,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:48:25,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:48:25,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:48:25,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:48:25,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:48:25,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:48:25,084 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:48:25,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:48:25,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:48:25,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:48:25,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:48:25,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:48:25,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:48:25,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:48:25,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:48:25,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:48:25,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:48:25,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:48:25,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:48:25,087 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:48:25,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:48:25,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:48:25,089 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 -> 61592663790a1842b8bd7e9befeca1c276604b90aee8701db027349608c78395 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:48:25,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:48:25,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:48:25,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:48:25,338 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:48:25,338 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:48:25,339 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_front_harness.i [2023-11-23 08:48:26,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:48:26,881 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:48:26,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness.i [2023-11-23 08:48:26,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abb40379e/2d972323a6c34e369d6bc51e342f88f7/FLAG2a0eccaa5 [2023-11-23 08:48:26,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abb40379e/2d972323a6c34e369d6bc51e342f88f7 [2023-11-23 08:48:26,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:48:26,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:48:26,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:48:26,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:48:26,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:48:26,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:48:26" (1/1) ... [2023-11-23 08:48:26,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@583d555a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:26, skipping insertion in model container [2023-11-23 08:48:26,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:48:26" (1/1) ... [2023-11-23 08:48:27,002 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:48:27,209 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_front_harness.i[4495,4508] [2023-11-23 08:48:27,217 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_front_harness.i[4555,4568] [2023-11-23 08:48:27,729 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:27,729 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:27,730 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:27,730 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:27,731 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:27,758 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:27,766 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:27,768 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:27,768 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:27,769 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:27,770 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:27,771 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:27,782 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:27,972 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:48:27,973 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:48:27,974 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:48:27,976 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:48:27,979 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:48:27,980 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:48:27,980 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:48:27,981 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:48:27,981 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:48:27,982 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:48:28,072 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:48:28,085 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:48:28,094 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_front_harness.i[4495,4508] [2023-11-23 08:48:28,094 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_front_harness.i[4555,4568] [2023-11-23 08:48:28,171 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:28,172 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:28,172 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:28,173 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:28,173 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:28,194 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:28,195 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:28,195 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:28,195 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:28,196 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:28,197 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:28,197 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:28,197 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:28,254 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:48:28,255 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:48:28,256 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:48:28,256 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:48:28,261 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:48:28,261 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:48:28,262 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:48:28,263 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:48:28,264 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:48:28,265 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:48:28,315 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:48:28,442 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:28,443 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:28,443 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:28,443 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:28,443 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:28,443 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:28,444 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:28,444 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:28,444 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:28,444 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:28,444 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:28,445 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:28,445 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:28,445 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:28,445 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:28,446 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:28,452 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:48:28,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:28 WrapperNode [2023-11-23 08:48:28,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:48:28,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:48:28,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:48:28,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:48:28,459 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:28" (1/1) ... [2023-11-23 08:48:28,523 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:28" (1/1) ... [2023-11-23 08:48:28,549 INFO L138 Inliner]: procedures = 678, calls = 1045, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 133 [2023-11-23 08:48:28,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:48:28,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:48:28,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:48:28,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:48:28,557 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:28" (1/1) ... [2023-11-23 08:48:28,567 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:28" (1/1) ... [2023-11-23 08:48:28,570 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:28" (1/1) ... [2023-11-23 08:48:28,570 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:28" (1/1) ... [2023-11-23 08:48:28,578 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:28" (1/1) ... [2023-11-23 08:48:28,594 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:28" (1/1) ... [2023-11-23 08:48:28,597 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:28" (1/1) ... [2023-11-23 08:48:28,598 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:28" (1/1) ... [2023-11-23 08:48:28,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:48:28,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:48:28,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:48:28,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:48:28,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:28" (1/1) ... [2023-11-23 08:48:28,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:48:28,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:28,646 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:28,665 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:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:48:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:48:28,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:48:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:48:28,693 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:48:28,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:48:28,694 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 08:48:28,694 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 08:48:28,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:48:28,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:48:28,694 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_front [2023-11-23 08:48:28,694 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_front [2023-11-23 08:48:28,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:48:28,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:48:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2023-11-23 08:48:28,695 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2023-11-23 08:48:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:48:28,695 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:48:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:48:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:48:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:48:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:48:28,696 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:48:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:48:28,696 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:48:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:48:28,885 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:48:28,886 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:48:29,073 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:48:29,126 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:48:29,126 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 08:48:29,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:48:29 BoogieIcfgContainer [2023-11-23 08:48:29,126 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:48:29,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:48:29,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:48:29,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:48:29,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:48:26" (1/3) ... [2023-11-23 08:48:29,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d872684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:48:29, skipping insertion in model container [2023-11-23 08:48:29,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:28" (2/3) ... [2023-11-23 08:48:29,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d872684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:48:29, skipping insertion in model container [2023-11-23 08:48:29,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:48:29" (3/3) ... [2023-11-23 08:48:29,132 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_front_harness.i [2023-11-23 08:48:29,144 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:48:29,145 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:48:29,177 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:48:29,188 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;@6b3b561f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:48:29,188 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:48:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-23 08:48:29,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 08:48:29,206 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:29,207 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:29,208 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:29,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:29,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1516907365, now seen corresponding path program 1 times [2023-11-23 08:48:29,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:29,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350656540] [2023-11-23 08:48:29,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:29,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:29,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:29,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:29,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:29,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:29,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:48:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:29,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:48:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:29,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:48:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:29,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:48:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:29,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:29,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:48:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:29,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:48:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-23 08:48:29,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:29,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350656540] [2023-11-23 08:48:29,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350656540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:29,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:48:29,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 08:48:29,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058251226] [2023-11-23 08:48:29,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:29,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:48:29,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:29,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:48:29,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:48:29,745 INFO L87 Difference]: Start difference. First operand has 87 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 08:48:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:29,796 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2023-11-23 08:48:29,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:48:29,798 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 79 [2023-11-23 08:48:29,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:29,806 INFO L225 Difference]: With dead ends: 168 [2023-11-23 08:48:29,817 INFO L226 Difference]: Without dead ends: 85 [2023-11-23 08:48:29,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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:29,822 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:29,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:48:29,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-23 08:48:29,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-23 08:48:29,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 53 states have internal predecessors, (67), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-23 08:48:29,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions. [2023-11-23 08:48:29,854 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 79 [2023-11-23 08:48:29,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:29,855 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 114 transitions. [2023-11-23 08:48:29,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 08:48:29,855 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2023-11-23 08:48:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 08:48:29,860 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:29,860 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:29,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:48:29,862 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:29,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:29,863 INFO L85 PathProgramCache]: Analyzing trace with hash 887625179, now seen corresponding path program 1 times [2023-11-23 08:48:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:29,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980440549] [2023-11-23 08:48:29,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:29,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:30,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:30,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:30,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:30,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:30,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:48:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:30,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:48:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:30,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:48:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:30,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:48:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:30,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:30,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:48:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:30,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:48:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-23 08:48:30,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:30,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980440549] [2023-11-23 08:48:30,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980440549] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:30,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637475063] [2023-11-23 08:48:30,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:30,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:30,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:30,351 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:30,384 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:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:30,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-23 08:48:30,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:30,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 08:48:30,615 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:30,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:30,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:30,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:30,704 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 43 treesize of output 34 [2023-11-23 08:48:30,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:30,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:30,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-11-23 08:48:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-23 08:48:32,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:32,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637475063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:32,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:32,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2023-11-23 08:48:32,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983282143] [2023-11-23 08:48:32,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:32,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:48:32,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:32,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:48:32,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:48:32,254 INFO L87 Difference]: Start difference. First operand 85 states and 114 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 08:48:33,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:33,062 INFO L93 Difference]: Finished difference Result 236 states and 320 transitions. [2023-11-23 08:48:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 08:48:33,063 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 79 [2023-11-23 08:48:33,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:33,065 INFO L225 Difference]: With dead ends: 236 [2023-11-23 08:48:33,065 INFO L226 Difference]: Without dead ends: 164 [2023-11-23 08:48:33,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2023-11-23 08:48:33,066 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 82 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:33,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 539 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 08:48:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-23 08:48:33,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2023-11-23 08:48:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 100 states have (on average 1.3) internal successors, (130), 102 states have internal predecessors, (130), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-23 08:48:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 220 transitions. [2023-11-23 08:48:33,086 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 220 transitions. Word has length 79 [2023-11-23 08:48:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:33,087 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 220 transitions. [2023-11-23 08:48:33,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 08:48:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 220 transitions. [2023-11-23 08:48:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 08:48:33,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:33,088 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:33,104 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:33,301 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:33,302 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:33,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:33,302 INFO L85 PathProgramCache]: Analyzing trace with hash 501925275, now seen corresponding path program 1 times [2023-11-23 08:48:33,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:33,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324763148] [2023-11-23 08:48:33,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:33,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:48:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:48:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:48:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:48:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:48:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:48:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-23 08:48:33,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:33,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324763148] [2023-11-23 08:48:33,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324763148] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:33,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126899777] [2023-11-23 08:48:33,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:33,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:33,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:33,641 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:33,642 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:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-23 08:48:33,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:33,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 08:48:33,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:33,836 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 20 treesize of output 1 [2023-11-23 08:48:33,843 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:33,854 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:35,921 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse1 (select .cse0 .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse2 .cse1))) (<= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| .cse1))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|))))) is different from true [2023-11-23 08:48:36,208 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse1 (select .cse0 .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse2 .cse1))) (<= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| .cse1))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| 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_front_harness_~#list~0#1.base_BEFORE_CALL_9| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|) .cse4 .cse3) .cse5)) (<= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| .cse3))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|) (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|))))) is different from true [2023-11-23 08:48:49,273 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_7 Int)) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_7) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 Int)) (= v_aws_linked_list_front_~list.base_BEFORE_CALL_7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_7) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 24)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_7 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_7)) (.cse2 (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 24))) (let ((.cse0 (select .cse1 .cse2))) (and (<= v_aws_linked_list_front_~list.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_aws_linked_list_front_~list.base_BEFORE_CALL_7 v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_7) .cse2 .cse0))))))) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_7)))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_6 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 Int)) (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 24)) v_aws_linked_list_front_~list.base_BEFORE_CALL_6)) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_6))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_6 Int)) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_6) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_6)) (.cse4 (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 24))) (let ((.cse3 (select .cse5 .cse4))) (and (<= v_aws_linked_list_front_~list.base_BEFORE_CALL_6 .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_6 v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_6) .cse4 .cse3) .cse5))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse6 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| 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_front_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse8 .cse7))) (<= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| .cse7))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse11 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|)) (.cse10 (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| 24))) (let ((.cse9 (select .cse11 .cse10))) (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_front_harness_~#list~0#1.base_BEFORE_CALL_9| v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|) .cse10 .cse9) .cse11)) (<= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| .cse9))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|) (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|))))) is different from true [2023-11-23 08:48:52,232 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_7 Int)) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_7) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 Int)) (= v_aws_linked_list_front_~list.base_BEFORE_CALL_7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_7) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 24)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_7 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_7)) (.cse2 (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 24))) (let ((.cse0 (select .cse1 .cse2))) (and (<= v_aws_linked_list_front_~list.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_aws_linked_list_front_~list.base_BEFORE_CALL_7 v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_7) .cse2 .cse0))))))) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_7)))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_8 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_8)) (.cse5 (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_8 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_8) .cse5 .cse4))) (<= v_aws_linked_list_front_~list.base_BEFORE_CALL_8 .cse4))))) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_8))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_8 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 Int)) (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_8) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 24)) v_aws_linked_list_front_~list.base_BEFORE_CALL_8)) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_8)))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_6 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 Int)) (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 24)) v_aws_linked_list_front_~list.base_BEFORE_CALL_6)) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_6))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_6 Int)) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_6) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 Int)) (let ((.cse8 (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_6)) (.cse7 (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 24))) (let ((.cse6 (select .cse8 .cse7))) (and (<= v_aws_linked_list_front_~list.base_BEFORE_CALL_6 .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_6 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_6) .cse7 .cse6) .cse8))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse11 (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| 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_front_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse11 .cse10))) (<= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| .cse10))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse14 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| 24))) (let ((.cse12 (select .cse14 .cse13))) (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_front_harness_~#list~0#1.base_BEFORE_CALL_9| v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|) .cse13 .cse12) .cse14)) (<= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| .cse12))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|) (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|))))) is different from true [2023-11-23 08:48:57,161 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_7 Int)) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_7) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 Int)) (= v_aws_linked_list_front_~list.base_BEFORE_CALL_7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_7) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 24)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_7 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_7)) (.cse2 (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 24))) (let ((.cse0 (select .cse1 .cse2))) (and (<= v_aws_linked_list_front_~list.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_aws_linked_list_front_~list.base_BEFORE_CALL_7 v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_7) .cse2 .cse0))))))) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_7)))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_8 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_8)) (.cse5 (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_8 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_8) .cse5 .cse4))) (<= v_aws_linked_list_front_~list.base_BEFORE_CALL_8 .cse4))))) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_8))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_8 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 Int)) (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_8) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 24)) v_aws_linked_list_front_~list.base_BEFORE_CALL_8)) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_8)))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_6 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 Int)) (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 24)) v_aws_linked_list_front_~list.base_BEFORE_CALL_6)) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_6))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_6 Int)) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_6) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 Int)) (let ((.cse8 (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_6)) (.cse7 (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 24))) (let ((.cse6 (select .cse8 .cse7))) (and (<= v_aws_linked_list_front_~list.base_BEFORE_CALL_6 .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_6 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_6) .cse7 .cse6) .cse8))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse11 (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| 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_front_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse11 .cse10))) (<= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| .cse10))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse14 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| 24))) (let ((.cse12 (select .cse14 .cse13))) (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_front_harness_~#list~0#1.base_BEFORE_CALL_9| v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|) .cse13 .cse12) .cse14)) (<= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| .cse12))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|) (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|)))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_9 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 Int)) (let ((.cse16 (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_9)) (.cse17 (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 24))) (let ((.cse15 (select .cse16 .cse17))) (and (<= v_aws_linked_list_front_~list.base_BEFORE_CALL_9 .cse15) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse16 (store (select (store (store |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_9 v_DerPreprocessor_1) .cse15 v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_9) .cse17 .cse15))))))) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_9))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_9 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 Int)) (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_9) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 24)) v_aws_linked_list_front_~list.base_BEFORE_CALL_9)) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_9))))) is different from true [2023-11-23 08:49:24,235 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_7 Int)) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_7) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 Int)) (= v_aws_linked_list_front_~list.base_BEFORE_CALL_7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_7) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 24)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_7 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_7)) (.cse2 (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 24))) (let ((.cse0 (select .cse1 .cse2))) (and (<= v_aws_linked_list_front_~list.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_aws_linked_list_front_~list.base_BEFORE_CALL_7 v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_7) .cse2 .cse0))))))) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_7)))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_8 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_8)) (.cse5 (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_8 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_8) .cse5 .cse4))) (<= v_aws_linked_list_front_~list.base_BEFORE_CALL_8 .cse4))))) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_8))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_8 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 Int)) (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_8) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 24)) v_aws_linked_list_front_~list.base_BEFORE_CALL_8)) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_8)))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_6 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 Int)) (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 24)) v_aws_linked_list_front_~list.base_BEFORE_CALL_6)) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_6))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_6 Int)) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_6) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 Int)) (let ((.cse8 (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_6)) (.cse7 (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 24))) (let ((.cse6 (select .cse8 .cse7))) (and (<= v_aws_linked_list_front_~list.base_BEFORE_CALL_6 .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_6 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_6) .cse7 .cse6) .cse8))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse11 (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| 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_front_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse11 .cse10))) (<= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| .cse10))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_8|))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_10 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_10 Int)) (let ((.cse14 (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_10)) (.cse13 (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_10 24))) (let ((.cse12 (select .cse14 .cse13))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_10 v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_10) .cse13 .cse12) .cse14)) (<= v_aws_linked_list_front_~list.base_BEFORE_CALL_10 .cse12))))) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_10))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_10 Int)) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_10) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_10 Int)) (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_10) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_10 24)) v_aws_linked_list_front_~list.base_BEFORE_CALL_10))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse17 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|)) (.cse16 (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| 24))) (let ((.cse15 (select .cse17 .cse16))) (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_front_harness_~#list~0#1.base_BEFORE_CALL_9| v_DerPreprocessor_1) .cse15 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|) .cse16 .cse15) .cse17)) (<= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| .cse15))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|) (+ |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset_BEFORE_CALL_9| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_9|)))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_9 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 Int)) (let ((.cse19 (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_9)) (.cse20 (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 24))) (let ((.cse18 (select .cse19 .cse20))) (and (<= v_aws_linked_list_front_~list.base_BEFORE_CALL_9 .cse18) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse19 (store (select (store (store |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_9 v_DerPreprocessor_1) .cse18 v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_9) .cse20 .cse18))))))) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_9))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_9 Int)) (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 Int)) (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_9) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 24)) v_aws_linked_list_front_~list.base_BEFORE_CALL_9)) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_9)))) (or (< (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)) 1) |c_aws_linked_list_is_valid_#t~short310#1|)) is different from true [2023-11-23 08:49:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 45 not checked. [2023-11-23 08:49:25,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:49:25,890 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2023-11-23 08:49:25,891 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:49:25,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:49:25,907 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:49:25,912 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:49:25,940 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:49:25,943 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:49:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-23 08:49:27,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126899777] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 08:49:27,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:49:27,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 24] total 37 [2023-11-23 08:49:27,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484348487] [2023-11-23 08:49:27,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:27,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:49:27,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:27,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:49:27,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=787, Unknown=49, NotChecked=378, Total=1332 [2023-11-23 08:49:27,259 INFO L87 Difference]: Start difference. First operand 162 states and 220 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 08:49:28,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:28,066 INFO L93 Difference]: Finished difference Result 259 states and 360 transitions. [2023-11-23 08:49:28,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 08:49:28,066 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 79 [2023-11-23 08:49:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:28,069 INFO L225 Difference]: With dead ends: 259 [2023-11-23 08:49:28,069 INFO L226 Difference]: Without dead ends: 178 [2023-11-23 08:49:28,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 50.6s TimeCoverageRelationStatistics Valid=141, Invalid=1022, Unknown=51, NotChecked=426, Total=1640 [2023-11-23 08:49:28,070 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 54 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:28,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 661 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:49:28,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-23 08:49:28,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2023-11-23 08:49:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 104 states have internal predecessors, (132), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-23 08:49:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 222 transitions. [2023-11-23 08:49:28,088 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 222 transitions. Word has length 79 [2023-11-23 08:49:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:28,088 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 222 transitions. [2023-11-23 08:49:28,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 08:49:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 222 transitions. [2023-11-23 08:49:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 08:49:28,090 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:28,090 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:49:28,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-23 08:49:28,301 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:49:28,302 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:28,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:28,302 INFO L85 PathProgramCache]: Analyzing trace with hash -788495013, now seen corresponding path program 1 times [2023-11-23 08:49:28,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:28,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053388579] [2023-11-23 08:49:28,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:28,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:49:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:49:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:49:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:49:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:49:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:49:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:49:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:49:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-23 08:49:28,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:28,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053388579] [2023-11-23 08:49:28,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053388579] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:49:28,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305709486] [2023-11-23 08:49:28,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:28,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:49:28,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:49:28,489 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:49:28,489 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:49:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-23 08:49:28,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:49:28,637 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:49:28,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 08:49:28,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:49:28,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:49:28,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:49:28,686 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 43 treesize of output 34 [2023-11-23 08:49:28,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:49:28,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:49:28,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-11-23 08:49:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 08:49:29,369 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:49:29,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305709486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:29,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:49:29,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2023-11-23 08:49:29,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365598357] [2023-11-23 08:49:29,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:29,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 08:49:29,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:29,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 08:49:29,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-11-23 08:49:29,371 INFO L87 Difference]: Start difference. First operand 164 states and 222 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-23 08:49:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:30,623 INFO L93 Difference]: Finished difference Result 257 states and 348 transitions. [2023-11-23 08:49:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 08:49:30,623 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 79 [2023-11-23 08:49:30,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:30,625 INFO L225 Difference]: With dead ends: 257 [2023-11-23 08:49:30,625 INFO L226 Difference]: Without dead ends: 171 [2023-11-23 08:49:30,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2023-11-23 08:49:30,627 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 90 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:30,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 742 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 08:49:30,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-23 08:49:30,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 166. [2023-11-23 08:49:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 106 states have internal predecessors, (134), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-23 08:49:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2023-11-23 08:49:30,659 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 224 transitions. Word has length 79 [2023-11-23 08:49:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:30,661 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 224 transitions. [2023-11-23 08:49:30,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-23 08:49:30,661 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 224 transitions. [2023-11-23 08:49:30,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 08:49:30,668 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:30,668 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:49:30,686 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:49:30,881 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:49:30,882 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:30,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:30,882 INFO L85 PathProgramCache]: Analyzing trace with hash 363156763, now seen corresponding path program 1 times [2023-11-23 08:49:30,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:30,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124492090] [2023-11-23 08:49:30,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:30,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:49:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:30,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:49:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:31,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:31,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:49:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:31,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:49:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:31,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:49:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:31,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:49:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:31,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:31,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:49:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:31,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:49:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:31,063 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-23 08:49:31,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:31,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124492090] [2023-11-23 08:49:31,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124492090] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:49:31,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387168646] [2023-11-23 08:49:31,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:31,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:49:31,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:49:31,065 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:49:31,089 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:49:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:31,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-23 08:49:31,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:49:31,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-11-23 08:49:44,541 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_17 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_17 Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_17))) (and (= v_aws_linked_list_front_~list.base_BEFORE_CALL_17 (select .cse0 v_aws_linked_list_front_~list.offset_BEFORE_CALL_17)) (= v_aws_linked_list_front_~list.base_BEFORE_CALL_17 (select .cse0 (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_17 24))) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_17)))) is different from true [2023-11-23 08:49:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 08:49:44,728 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:49:44,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387168646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:44,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:49:44,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2023-11-23 08:49:44,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177674357] [2023-11-23 08:49:44,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:44,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 08:49:44,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:44,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 08:49:44,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=201, Unknown=2, NotChecked=28, Total=272 [2023-11-23 08:49:44,730 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-23 08:49:46,742 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,778 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:49:50,823 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:49:52,850 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:49:54,862 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:49:56,904 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:59,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:01,787 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:04,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:04,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:04,138 INFO L93 Difference]: Finished difference Result 267 states and 359 transitions. [2023-11-23 08:50:04,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 08:50:04,138 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 79 [2023-11-23 08:50:04,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:04,141 INFO L225 Difference]: With dead ends: 267 [2023-11-23 08:50:04,141 INFO L226 Difference]: Without dead ends: 175 [2023-11-23 08:50:04,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=67, Invalid=315, Unknown=2, NotChecked=36, Total=420 [2023-11-23 08:50:04,142 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 117 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 43 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:04,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 710 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 547 Invalid, 9 Unknown, 248 Unchecked, 19.3s Time] [2023-11-23 08:50:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-23 08:50:04,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2023-11-23 08:50:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 108 states have internal predecessors, (136), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-23 08:50:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 226 transitions. [2023-11-23 08:50:04,179 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 226 transitions. Word has length 79 [2023-11-23 08:50:04,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:04,179 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 226 transitions. [2023-11-23 08:50:04,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-23 08:50:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 226 transitions. [2023-11-23 08:50:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 08:50:04,181 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:04,181 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:50:04,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 08:50:04,389 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:50:04,389 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:04,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:04,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1001048869, now seen corresponding path program 1 times [2023-11-23 08:50:04,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:04,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078255192] [2023-11-23 08:50:04,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:04,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:04,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:04,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:04,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:50:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:04,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:04,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:50:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:04,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:50:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:04,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:50:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:04,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:50:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:04,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:04,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:50:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:04,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:50:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-23 08:50:04,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:04,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078255192] [2023-11-23 08:50:04,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078255192] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:04,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209046549] [2023-11-23 08:50:04,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:04,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:04,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:04,598 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:50:04,599 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:50:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:04,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:50:04,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-23 08:50:04,790 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:50:04,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209046549] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:04,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:50:04,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2023-11-23 08:50:04,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443542098] [2023-11-23 08:50:04,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:04,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:50:04,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:04,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:50:04,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:50:04,792 INFO L87 Difference]: Start difference. First operand 168 states and 226 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 08:50:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:04,873 INFO L93 Difference]: Finished difference Result 343 states and 468 transitions. [2023-11-23 08:50:04,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:50:04,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 79 [2023-11-23 08:50:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:04,875 INFO L225 Difference]: With dead ends: 343 [2023-11-23 08:50:04,875 INFO L226 Difference]: Without dead ends: 161 [2023-11-23 08:50:04,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:50:04,876 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 44 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:04,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 518 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:50:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-11-23 08:50:04,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2023-11-23 08:50:04,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 101 states have internal predecessors, (123), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-23 08:50:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 213 transitions. [2023-11-23 08:50:04,890 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 213 transitions. Word has length 79 [2023-11-23 08:50:04,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:04,891 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 213 transitions. [2023-11-23 08:50:04,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 08:50:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 213 transitions. [2023-11-23 08:50:04,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:50:04,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:04,892 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:50:04,909 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:50:05,104 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:50:05,105 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:05,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:05,105 INFO L85 PathProgramCache]: Analyzing trace with hash 769449205, now seen corresponding path program 1 times [2023-11-23 08:50:05,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:05,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434591689] [2023-11-23 08:50:05,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:05,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:05,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:05,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:05,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:50:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:05,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:05,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:50:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:05,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:50:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:05,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:50:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:05,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:50:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:05,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:05,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:50:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:05,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:50:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-23 08:50:05,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:05,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434591689] [2023-11-23 08:50:05,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434591689] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:05,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279962087] [2023-11-23 08:50:05,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:05,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:05,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:05,311 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:50:05,340 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:50:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:05,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-23 08:50:05,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:05,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 08:50:05,555 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:50:05,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 08:50:05,597 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 08:50:05,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 08:50:05,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:05,616 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-23 08:50:05,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:05,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:05,621 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:50:05,623 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:50:05,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-23 08:50:05,676 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 89 treesize of output 13 [2023-11-23 08:50:05,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:05,680 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:50:05,683 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:50:06,577 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-23 08:50:06,578 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:50:06,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:50:06,910 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:50:07,004 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:50:07,005 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:50:07,067 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 08:50:07,067 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 299 treesize of output 286 [2023-11-23 08:50:07,076 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:50:07,077 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:50:07,131 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 08:50:07,131 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 203 treesize of output 232 [2023-11-23 08:50:07,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:50:07,159 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 262 treesize of output 260 [2023-11-23 08:50:07,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 207 [2023-11-23 08:50:07,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:50:07,186 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 298 treesize of output 298 [2023-11-23 08:50:07,196 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 265 treesize of output 253 [2023-11-23 08:50:07,237 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:50:08,560 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:50:08,573 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:50:08,587 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:50:08,592 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:50:08,624 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:50:08,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:50:08,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 969 treesize of output 939 [2023-11-23 08:50:09,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:50:09,524 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 1307 treesize of output 1183 [2023-11-23 08:50:11,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279962087] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:11,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:50:11,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12] total 17 [2023-11-23 08:50:11,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872590172] [2023-11-23 08:50:11,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:50:11,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-23 08:50:11,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:11,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-23 08:50:11,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=565, Unknown=11, NotChecked=0, Total=650 [2023-11-23 08:50:11,295 INFO L87 Difference]: Start difference. First operand 161 states and 213 transitions. Second operand has 17 states, 16 states have (on average 4.5625) internal successors, (73), 15 states have internal predecessors, (73), 7 states have call successors, (23), 5 states have call predecessors, (23), 6 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2023-11-23 08:50:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:12,672 INFO L93 Difference]: Finished difference Result 243 states and 322 transitions. [2023-11-23 08:50:12,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-23 08:50:12,672 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.5625) internal successors, (73), 15 states have internal predecessors, (73), 7 states have call successors, (23), 5 states have call predecessors, (23), 6 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) Word has length 80 [2023-11-23 08:50:12,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:12,673 INFO L225 Difference]: With dead ends: 243 [2023-11-23 08:50:12,674 INFO L226 Difference]: Without dead ends: 170 [2023-11-23 08:50:12,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 142 SyntacticMatches, 15 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=189, Invalid=1358, Unknown=13, NotChecked=0, Total=1560 [2023-11-23 08:50:12,677 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 175 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:12,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1346 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 08:50:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-23 08:50:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2023-11-23 08:50:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 107 states have internal predecessors, (128), 46 states have call successors, (46), 16 states have call predecessors, (46), 17 states have return successors, (46), 44 states have call predecessors, (46), 44 states have call successors, (46) [2023-11-23 08:50:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 220 transitions. [2023-11-23 08:50:12,707 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 220 transitions. Word has length 80 [2023-11-23 08:50:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:12,708 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 220 transitions. [2023-11-23 08:50:12,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.5625) internal successors, (73), 15 states have internal predecessors, (73), 7 states have call successors, (23), 5 states have call predecessors, (23), 6 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2023-11-23 08:50:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 220 transitions. [2023-11-23 08:50:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 08:50:12,710 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:12,710 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:50:12,724 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:50:12,910 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:50:12,911 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:12,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:12,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1069413833, now seen corresponding path program 1 times [2023-11-23 08:50:12,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:12,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711525358] [2023-11-23 08:50:12,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:12,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:50:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:50:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:50:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:50:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:50:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 08:50:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 08:50:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-23 08:50:13,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:13,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711525358] [2023-11-23 08:50:13,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711525358] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:13,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93429253] [2023-11-23 08:50:13,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:13,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:13,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:13,098 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:50:13,120 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:50:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 08:50:13,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:13,323 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:50:13,323 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:50:13,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93429253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:13,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:50:13,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2023-11-23 08:50:13,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948437990] [2023-11-23 08:50:13,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:13,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:50:13,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:13,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:50:13,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:50:13,325 INFO L87 Difference]: Start difference. First operand 168 states and 220 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 08:50:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:13,454 INFO L93 Difference]: Finished difference Result 315 states and 415 transitions. [2023-11-23 08:50:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:50:13,454 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 82 [2023-11-23 08:50:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:13,455 INFO L225 Difference]: With dead ends: 315 [2023-11-23 08:50:13,455 INFO L226 Difference]: Without dead ends: 168 [2023-11-23 08:50:13,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-11-23 08:50:13,456 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 42 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:13,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 555 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:50:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-23 08:50:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2023-11-23 08:50:13,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 107 states have internal predecessors, (126), 46 states have call successors, (46), 16 states have call predecessors, (46), 17 states have return successors, (46), 44 states have call predecessors, (46), 44 states have call successors, (46) [2023-11-23 08:50:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 218 transitions. [2023-11-23 08:50:13,473 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 218 transitions. Word has length 82 [2023-11-23 08:50:13,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:13,473 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 218 transitions. [2023-11-23 08:50:13,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 08:50:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 218 transitions. [2023-11-23 08:50:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-23 08:50:13,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:13,474 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:50:13,488 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:50:13,686 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:50:13,687 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:13,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:13,687 INFO L85 PathProgramCache]: Analyzing trace with hash -664208662, now seen corresponding path program 1 times [2023-11-23 08:50:13,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:13,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900879981] [2023-11-23 08:50:13,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:13,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:50:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:50:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:50:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:50:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:50:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:50:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 08:50:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:13,867 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-23 08:50:13,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:13,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900879981] [2023-11-23 08:50:13,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900879981] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:13,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564107874] [2023-11-23 08:50:13,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:13,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:13,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:13,869 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:50:13,895 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:50:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-23 08:50:14,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:50:14,091 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:50:14,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564107874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:14,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:50:14,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2023-11-23 08:50:14,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167401889] [2023-11-23 08:50:14,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:14,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:50:14,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:14,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:50:14,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:50:14,095 INFO L87 Difference]: Start difference. First operand 168 states and 218 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 08:50:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:14,285 INFO L93 Difference]: Finished difference Result 329 states and 433 transitions. [2023-11-23 08:50:14,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:50:14,286 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 84 [2023-11-23 08:50:14,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:14,287 INFO L225 Difference]: With dead ends: 329 [2023-11-23 08:50:14,287 INFO L226 Difference]: Without dead ends: 180 [2023-11-23 08:50:14,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-11-23 08:50:14,288 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 64 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:14,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 622 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:50:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-23 08:50:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 170. [2023-11-23 08:50:14,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 109 states have internal predecessors, (128), 46 states have call successors, (46), 16 states have call predecessors, (46), 17 states have return successors, (46), 44 states have call predecessors, (46), 44 states have call successors, (46) [2023-11-23 08:50:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 220 transitions. [2023-11-23 08:50:14,311 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 220 transitions. Word has length 84 [2023-11-23 08:50:14,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:14,311 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 220 transitions. [2023-11-23 08:50:14,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 08:50:14,311 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 220 transitions. [2023-11-23 08:50:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-23 08:50:14,312 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:14,312 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:50:14,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-23 08:50:14,524 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:50:14,524 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:14,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash -451382076, now seen corresponding path program 1 times [2023-11-23 08:50:14,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:14,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714297985] [2023-11-23 08:50:14,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:14,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:50:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:50:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:50:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:50:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 08:50:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:50:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:50:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-23 08:50:14,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:14,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714297985] [2023-11-23 08:50:14,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714297985] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:14,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900707240] [2023-11-23 08:50:14,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:14,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:14,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:14,773 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:50:14,774 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:50:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 08:50:14,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-23 08:50:14,931 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:50:14,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900707240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:14,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:50:14,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-23 08:50:14,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266783506] [2023-11-23 08:50:14,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:14,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 08:50:14,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:14,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 08:50:14,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:50:14,933 INFO L87 Difference]: Start difference. First operand 170 states and 220 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-23 08:50:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:14,970 INFO L93 Difference]: Finished difference Result 321 states and 425 transitions. [2023-11-23 08:50:14,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 08:50:14,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 85 [2023-11-23 08:50:14,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:14,973 INFO L225 Difference]: With dead ends: 321 [2023-11-23 08:50:14,973 INFO L226 Difference]: Without dead ends: 178 [2023-11-23 08:50:14,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:50:14,974 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:14,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 197 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:50:14,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-23 08:50:14,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 172. [2023-11-23 08:50:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 108 states have (on average 1.2037037037037037) internal successors, (130), 111 states have internal predecessors, (130), 46 states have call successors, (46), 16 states have call predecessors, (46), 17 states have return successors, (46), 44 states have call predecessors, (46), 44 states have call successors, (46) [2023-11-23 08:50:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 222 transitions. [2023-11-23 08:50:14,993 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 222 transitions. Word has length 85 [2023-11-23 08:50:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:14,994 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 222 transitions. [2023-11-23 08:50:14,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-23 08:50:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 222 transitions. [2023-11-23 08:50:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-23 08:50:14,995 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:14,996 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:50:15,020 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:50:15,208 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:50:15,208 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:15,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:15,209 INFO L85 PathProgramCache]: Analyzing trace with hash -272758048, now seen corresponding path program 1 times [2023-11-23 08:50:15,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:15,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589805251] [2023-11-23 08:50:15,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:15,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:50:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:50:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:50:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:50:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:50:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:50:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:50:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:50:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-23 08:50:15,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:15,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589805251] [2023-11-23 08:50:15,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589805251] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:15,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344188140] [2023-11-23 08:50:15,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:15,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:15,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:15,426 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:50:15,453 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:50:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 108 conjunts are in the unsatisfiable core [2023-11-23 08:50:15,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:15,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 08:50:15,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:15,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 08:50:15,774 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 08:50:15,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:15,779 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 41 treesize of output 13 [2023-11-23 08:50:15,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:15,786 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 33 treesize of output 21 [2023-11-23 08:50:15,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:15,864 INFO L349 Elim1Store]: treesize reduction 119, result has 15.0 percent of original size [2023-11-23 08:50:15,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 154 treesize of output 83 [2023-11-23 08:50:15,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:15,876 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-11-23 08:50:15,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 54 [2023-11-23 08:50:17,428 INFO L349 Elim1Store]: treesize reduction 268, result has 0.4 percent of original size [2023-11-23 08:50:17,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 19 case distinctions, treesize of input 168 treesize of output 1 [2023-11-23 08:50:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 08:50:17,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:50:21,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:50:21,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 211696 treesize of output 189017 [2023-11-23 08:50:29,860 WARN L293 SmtUtils]: Spent 8.72s on a formula simplification. DAG size of input: 620 DAG size of output: 570 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-23 08:50:30,705 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:50:35,838 INFO L349 Elim1Store]: treesize reduction 1344, result has 37.2 percent of original size [2023-11-23 08:50:35,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 2 disjoint index pairs (out of 190 index pairs), introduced 21 new quantified variables, introduced 190 case distinctions, treesize of input 865082826 treesize of output 849529067 Killed by 15