./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness_negated.i --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 52acad1f86dde00e055ff68c84610663a6ee1e8b549596d6f4e68b872dd717ff --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:47:29,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:47:29,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:47:29,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:47:29,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:47:30,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:47:30,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:47:30,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:47:30,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:47:30,018 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:47:30,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:47:30,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:47:30,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:47:30,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:47:30,020 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:47:30,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:47:30,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:47:30,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:47:30,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:47:30,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:47:30,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:47:30,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:47:30,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:47:30,022 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:47:30,023 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:47:30,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:47:30,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:47:30,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:47:30,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:47:30,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:47:30,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:47:30,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:47:30,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:47:30,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:47:30,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:47:30,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:47:30,026 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:47:30,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:47:30,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:47:30,026 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 -> 52acad1f86dde00e055ff68c84610663a6ee1e8b549596d6f4e68b872dd717ff Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:47:30,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:47:30,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:47:30,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:47:30,260 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:47:30,260 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:47:30,261 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_begin_harness_negated.i [2023-11-23 08:47:31,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:47:31,703 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:47:31,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness_negated.i [2023-11-23 08:47:31,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68dd1b117/f511378a51a34cfebce54201482f0e75/FLAGb8056602d [2023-11-23 08:47:31,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68dd1b117/f511378a51a34cfebce54201482f0e75 [2023-11-23 08:47:31,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:47:31,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:47:31,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:47:31,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:47:31,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:47:31,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:47:31" (1/1) ... [2023-11-23 08:47:31,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50807774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:31, skipping insertion in model container [2023-11-23 08:47:31,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:47:31" (1/1) ... [2023-11-23 08:47:31,861 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:47:32,020 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_begin_harness_negated.i[4495,4508] [2023-11-23 08:47:32,026 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_begin_harness_negated.i[4555,4568] [2023-11-23 08:47:32,478 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,482 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,483 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,484 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,485 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,502 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,502 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,503 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,504 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,505 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,505 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,506 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,506 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,696 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:47:32,697 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:47:32,697 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:47:32,698 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:47:32,699 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:47:32,699 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:47:32,700 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:47:32,700 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:47:32,700 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:47:32,710 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:47:32,819 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:47:32,831 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:47:32,847 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_begin_harness_negated.i[4495,4508] [2023-11-23 08:47:32,847 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_begin_harness_negated.i[4555,4568] [2023-11-23 08:47:32,873 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,877 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,877 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,877 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,878 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,891 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,892 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,893 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,893 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,896 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,897 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,897 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,897 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:47:32,949 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:47:32,952 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:47:32,953 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:47:32,954 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:47:32,954 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:47:32,955 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:47:32,955 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:47:32,957 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:47:32,957 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:47:32,957 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:47:32,993 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:47:33,141 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:47:33,141 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:47:33,141 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:47:33,141 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:47:33,141 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:47:33,142 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:47:33,142 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:47:33,142 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:47:33,142 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:47:33,142 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:47:33,142 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:47:33,142 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:47:33,142 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:47:33,143 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:47:33,143 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:47:33,143 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:47:33,148 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:47:33,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:33 WrapperNode [2023-11-23 08:47:33,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:47:33,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:47:33,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:47:33,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:47:33,154 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:47:33" (1/1) ... [2023-11-23 08:47:33,193 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:47:33" (1/1) ... [2023-11-23 08:47:33,217 INFO L138 Inliner]: procedures = 678, calls = 1041, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 141 [2023-11-23 08:47:33,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:47:33,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:47:33,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:47:33,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:47:33,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:33" (1/1) ... [2023-11-23 08:47:33,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:33" (1/1) ... [2023-11-23 08:47:33,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:33" (1/1) ... [2023-11-23 08:47:33,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:33" (1/1) ... [2023-11-23 08:47:33,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:33" (1/1) ... [2023-11-23 08:47:33,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:33" (1/1) ... [2023-11-23 08:47:33,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:33" (1/1) ... [2023-11-23 08:47:33,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:33" (1/1) ... [2023-11-23 08:47:33,293 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:47:33,294 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:47:33,294 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:47:33,294 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:47:33,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:33" (1/1) ... [2023-11-23 08:47:33,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:47:33,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:47:33,357 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:47:33,378 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:47:33,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:47:33,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:47:33,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:47:33,399 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:47:33,399 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:47:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:47:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 08:47:33,400 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 08:47:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:47:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:47:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:47:33,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:47:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:47:33,401 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:47:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:47:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:47:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:47:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:47:33,402 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:47:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:47:33,585 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:47:33,587 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:47:33,750 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:47:33,797 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:47:33,799 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 08:47:33,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:47:33 BoogieIcfgContainer [2023-11-23 08:47:33,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:47:33,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:47:33,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:47:33,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:47:33,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:47:31" (1/3) ... [2023-11-23 08:47:33,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274c2423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:47:33, skipping insertion in model container [2023-11-23 08:47:33,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:33" (2/3) ... [2023-11-23 08:47:33,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274c2423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:47:33, skipping insertion in model container [2023-11-23 08:47:33,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:47:33" (3/3) ... [2023-11-23 08:47:33,808 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_begin_harness_negated.i [2023-11-23 08:47:33,823 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:47:33,823 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:47:33,864 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:47:33,869 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;@72023f1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:47:33,870 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:47:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-23 08:47:33,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:47:33,882 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:47:33,883 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:47:33,883 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:47:33,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:47:33,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1769392804, now seen corresponding path program 1 times [2023-11-23 08:47:33,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:47:33,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674615234] [2023-11-23 08:47:33,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:47:33,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:47:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:34,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:47:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:34,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:47:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:34,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:47:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:34,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:47:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:34,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:47:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:34,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:47:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:34,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:47:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-23 08:47:34,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:47:34,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674615234] [2023-11-23 08:47:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674615234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:47:34,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:47:34,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 08:47:34,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314385754] [2023-11-23 08:47:34,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:47:34,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:47:34,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:47:34,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:47:34,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:47:34,369 INFO L87 Difference]: Start difference. First operand has 60 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:47:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:47:34,416 INFO L93 Difference]: Finished difference Result 114 states and 170 transitions. [2023-11-23 08:47:34,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:47:34,418 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2023-11-23 08:47:34,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:47:34,425 INFO L225 Difference]: With dead ends: 114 [2023-11-23 08:47:34,425 INFO L226 Difference]: Without dead ends: 58 [2023-11-23 08:47:34,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:47:34,434 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:47:34,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:47:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-23 08:47:34,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-23 08:47:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 08:47:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2023-11-23 08:47:34,475 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 65 [2023-11-23 08:47:34,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:47:34,475 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2023-11-23 08:47:34,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:47:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2023-11-23 08:47:34,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:47:34,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:47:34,485 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:47:34,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:47:34,487 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:47:34,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:47:34,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1112295830, now seen corresponding path program 1 times [2023-11-23 08:47:34,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:47:34,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292388167] [2023-11-23 08:47:34,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:47:34,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:47:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:34,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:47:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:34,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:47:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:34,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:47:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:47:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:34,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:47:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:34,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:47:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:34,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:47:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:34,956 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:47:34,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:47:34,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292388167] [2023-11-23 08:47:34,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292388167] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:47:34,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59745129] [2023-11-23 08:47:34,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:47:34,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:47:34,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:47:34,960 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:47:34,973 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:47:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:35,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-23 08:47:35,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:47:35,226 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:47:35,237 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:47:35,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:35,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:35,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:35,310 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 45 treesize of output 25 [2023-11-23 08:47:35,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:35,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:35,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:35,318 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 45 treesize of output 25 [2023-11-23 08:47:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:47:35,956 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:47:35,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59745129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:47:35,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:47:35,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2023-11-23 08:47:35,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356950907] [2023-11-23 08:47:35,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:47:35,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:47:35,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:47:35,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:47:35,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:47:35,959 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 08:47:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:47:36,446 INFO L93 Difference]: Finished difference Result 160 states and 217 transitions. [2023-11-23 08:47:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:47:36,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2023-11-23 08:47:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:47:36,448 INFO L225 Difference]: With dead ends: 160 [2023-11-23 08:47:36,448 INFO L226 Difference]: Without dead ends: 110 [2023-11-23 08:47:36,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:47:36,450 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 43 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:47:36,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 361 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:47:36,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-23 08:47:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2023-11-23 08:47:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 76 states have internal predecessors, (100), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 08:47:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2023-11-23 08:47:36,468 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 65 [2023-11-23 08:47:36,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:47:36,469 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2023-11-23 08:47:36,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 08:47:36,469 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2023-11-23 08:47:36,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:47:36,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:47:36,474 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:47:36,490 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:47:36,687 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:47:36,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:47:36,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:47:36,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1684399024, now seen corresponding path program 1 times [2023-11-23 08:47:36,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:47:36,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025268723] [2023-11-23 08:47:36,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:47:36,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:47:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:36,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:47:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:36,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:47:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:36,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:47:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:36,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:47:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:36,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:47:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:36,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:47:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:36,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:47:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:47:36,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:47:36,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025268723] [2023-11-23 08:47:36,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025268723] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:47:36,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083051416] [2023-11-23 08:47:36,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:47:36,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:47:36,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:47:36,889 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:47:36,908 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:47:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:37,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-23 08:47:37,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:47:37,077 INFO L349 Elim1Store]: treesize reduction 42, result has 31.1 percent of original size [2023-11-23 08:47:37,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 80 [2023-11-23 08:47:37,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-11-23 08:47:37,097 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:47:37,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-23 08:47:37,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 22 [2023-11-23 08:47:39,204 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (< |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse1))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse0 (select v_DerPreprocessor_2 .cse1)) (= v_DerPreprocessor_1 (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|))))))))))) is different from true [2023-11-23 08:47:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:47:39,620 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:47:39,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083051416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:47:39,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:47:39,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2023-11-23 08:47:39,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199087098] [2023-11-23 08:47:39,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:47:39,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:47:39,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:47:39,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:47:39,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=131, Unknown=1, NotChecked=22, Total=182 [2023-11-23 08:47:39,622 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:47:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:47:40,300 INFO L93 Difference]: Finished difference Result 189 states and 259 transitions. [2023-11-23 08:47:40,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:47:40,301 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 08:47:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:47:40,303 INFO L225 Difference]: With dead ends: 189 [2023-11-23 08:47:40,303 INFO L226 Difference]: Without dead ends: 130 [2023-11-23 08:47:40,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2023-11-23 08:47:40,304 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 58 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 08:47:40,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 345 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 5 Unknown, 155 Unchecked, 0.6s Time] [2023-11-23 08:47:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-23 08:47:40,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2023-11-23 08:47:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 95 states have internal predecessors, (128), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-23 08:47:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 176 transitions. [2023-11-23 08:47:40,320 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 176 transitions. Word has length 65 [2023-11-23 08:47:40,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:47:40,320 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 176 transitions. [2023-11-23 08:47:40,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:47:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 176 transitions. [2023-11-23 08:47:40,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:47:40,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:47:40,321 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:47:40,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 08:47:40,533 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:47:40,533 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:47:40,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:47:40,534 INFO L85 PathProgramCache]: Analyzing trace with hash 243873678, now seen corresponding path program 1 times [2023-11-23 08:47:40,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:47:40,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121121938] [2023-11-23 08:47:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:47:40,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:47:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:40,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:47:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:40,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:47:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:40,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:47:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:40,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:47:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:40,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:47:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:40,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:47:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:40,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:47:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:40,822 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:47:40,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:47:40,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121121938] [2023-11-23 08:47:40,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121121938] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:47:40,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712473897] [2023-11-23 08:47:40,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:47:40,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:47:40,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:47:40,823 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:47:40,847 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:47:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:40,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-23 08:47:40,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:47:40,959 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:47:40,966 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:47:41,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:41,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:41,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:41,018 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 45 treesize of output 25 [2023-11-23 08:47:41,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:41,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:41,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:41,023 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 45 treesize of output 25 [2023-11-23 08:47:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:47:41,312 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:47:41,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712473897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:47:41,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:47:41,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2023-11-23 08:47:41,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318528741] [2023-11-23 08:47:41,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:47:41,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:47:41,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:47:41,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:47:41,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:47:41,314 INFO L87 Difference]: Start difference. First operand 129 states and 176 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:47:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:47:41,772 INFO L93 Difference]: Finished difference Result 217 states and 299 transitions. [2023-11-23 08:47:41,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 08:47:41,773 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 08:47:41,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:47:41,775 INFO L225 Difference]: With dead ends: 217 [2023-11-23 08:47:41,775 INFO L226 Difference]: Without dead ends: 155 [2023-11-23 08:47:41,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-11-23 08:47:41,776 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 113 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:47:41,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 337 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:47:41,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-23 08:47:41,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 146. [2023-11-23 08:47:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 111 states have internal predecessors, (150), 26 states have call successors, (26), 10 states have call predecessors, (26), 11 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2023-11-23 08:47:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 202 transitions. [2023-11-23 08:47:41,795 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 202 transitions. Word has length 65 [2023-11-23 08:47:41,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:47:41,795 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 202 transitions. [2023-11-23 08:47:41,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:47:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 202 transitions. [2023-11-23 08:47:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:47:41,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:47:41,796 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:47:41,808 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:47:42,003 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:47:42,003 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:47:42,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:47:42,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2111931572, now seen corresponding path program 1 times [2023-11-23 08:47:42,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:47:42,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606324902] [2023-11-23 08:47:42,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:47:42,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:47:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:42,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:47:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:42,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:47:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:42,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:47:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:42,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:47:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:42,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:47:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:42,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:47:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:42,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:47:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:47:42,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:47:42,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606324902] [2023-11-23 08:47:42,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606324902] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:47:42,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584009062] [2023-11-23 08:47:42,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:47:42,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:47:42,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:47:42,437 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:47:42,441 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:47:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:42,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-23 08:47:42,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:47:42,619 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 26 treesize of output 1 [2023-11-23 08:47:43,873 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-23 08:47:43,873 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 22 treesize of output 10 [2023-11-23 08:47:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:47:43,876 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:47:43,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584009062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:47:43,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:47:43,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2023-11-23 08:47:43,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060371088] [2023-11-23 08:47:43,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:47:43,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:47:43,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:47:43,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:47:43,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:47:43,878 INFO L87 Difference]: Start difference. First operand 146 states and 202 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:47:45,888 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:47:47,914 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:47:49,931 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:47:51,953 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:47:53,963 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:47:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:47:54,265 INFO L93 Difference]: Finished difference Result 263 states and 368 transitions. [2023-11-23 08:47:54,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:47:54,266 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 08:47:54,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:47:54,267 INFO L225 Difference]: With dead ends: 263 [2023-11-23 08:47:54,267 INFO L226 Difference]: Without dead ends: 182 [2023-11-23 08:47:54,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:47:54,270 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 95 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 14 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:47:54,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 401 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 289 Invalid, 5 Unknown, 0 Unchecked, 10.3s Time] [2023-11-23 08:47:54,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-23 08:47:54,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 152. [2023-11-23 08:47:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 117 states have internal predecessors, (158), 26 states have call successors, (26), 10 states have call predecessors, (26), 11 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2023-11-23 08:47:54,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 210 transitions. [2023-11-23 08:47:54,291 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 210 transitions. Word has length 65 [2023-11-23 08:47:54,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:47:54,291 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 210 transitions. [2023-11-23 08:47:54,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:47:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 210 transitions. [2023-11-23 08:47:54,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:47:54,292 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:47:54,293 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:47:54,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-23 08:47:54,504 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:47:54,505 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:47:54,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:47:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1701955466, now seen corresponding path program 1 times [2023-11-23 08:47:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:47:54,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303734422] [2023-11-23 08:47:54,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:47:54,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:47:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:54,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:47:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:54,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:47:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:54,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:47:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:54,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:47:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:54,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:47:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:54,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:47:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:54,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:47:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:54,666 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:47:54,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:47:54,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303734422] [2023-11-23 08:47:54,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303734422] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:47:54,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986690722] [2023-11-23 08:47:54,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:47:54,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:47:54,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:47:54,668 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:47:54,692 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:47:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:54,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 08:47:54,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:47:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:47:54,843 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:47:54,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986690722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:47:54,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:47:54,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-11-23 08:47:54,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433608422] [2023-11-23 08:47:54,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:47:54,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:47:54,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:47:54,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:47:54,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:47:54,846 INFO L87 Difference]: Start difference. First operand 152 states and 210 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:47:54,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:47:54,885 INFO L93 Difference]: Finished difference Result 324 states and 461 transitions. [2023-11-23 08:47:54,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:47:54,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2023-11-23 08:47:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:47:54,887 INFO L225 Difference]: With dead ends: 324 [2023-11-23 08:47:54,887 INFO L226 Difference]: Without dead ends: 189 [2023-11-23 08:47:54,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:47:54,889 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 34 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:47:54,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 212 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:47:54,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-11-23 08:47:54,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 159. [2023-11-23 08:47:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 119 states have (on average 1.3865546218487395) internal successors, (165), 123 states have internal predecessors, (165), 27 states have call successors, (27), 10 states have call predecessors, (27), 12 states have return successors, (29), 25 states have call predecessors, (29), 25 states have call successors, (29) [2023-11-23 08:47:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 221 transitions. [2023-11-23 08:47:54,903 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 221 transitions. Word has length 65 [2023-11-23 08:47:54,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:47:54,903 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 221 transitions. [2023-11-23 08:47:54,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:47:54,903 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2023-11-23 08:47:54,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-23 08:47:54,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:47:54,904 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:47:54,918 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:47:55,116 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:47:55,116 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:47:55,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:47:55,116 INFO L85 PathProgramCache]: Analyzing trace with hash -879428092, now seen corresponding path program 1 times [2023-11-23 08:47:55,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:47:55,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115993996] [2023-11-23 08:47:55,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:47:55,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:47:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:55,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:47:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:55,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:47:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:55,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:47:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:55,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:47:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:55,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:47:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:55,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:47:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:55,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 08:47:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 08:47:55,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:47:55,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115993996] [2023-11-23 08:47:55,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115993996] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:47:55,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065443979] [2023-11-23 08:47:55,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:47:55,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:47:55,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:47:55,321 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:47:55,322 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:47:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:47:55,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-23 08:47:55,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:47:55,506 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:47:55,530 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:47:55,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:55,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:55,572 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:47:55,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:55,576 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:47:55,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:55,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:55,584 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:47:55,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:55,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-23 08:47:55,672 INFO L349 Elim1Store]: treesize reduction 50, result has 18.0 percent of original size [2023-11-23 08:47:55,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 163 treesize of output 161 [2023-11-23 08:47:55,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:55,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:55,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:55,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 118 [2023-11-23 08:47:55,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:55,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 25 [2023-11-23 08:47:55,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:47:55,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 24 [2023-11-23 08:47:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 08:47:57,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:47:57,379 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 16))) (and (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_487 Int) (v_ArrVal_486 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_486)))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_487))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_488 Int) (v_ArrVal_489 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_489))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_488))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2023-11-23 08:47:57,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:47:57,396 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:47:57,420 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 16))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_23| Int)) (or (forall ((v_ArrVal_487 Int) (v_arrayElimArr_7 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_14| Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_14|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_23| v_arrayElimArr_7))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_487))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_23| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_23| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_23| 1)) (forall ((v_ArrVal_488 Int) (v_ArrVal_489 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_23|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_23| v_ArrVal_489))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_488))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2023-11-23 08:47:57,431 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:47:57,432 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:47:57,484 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 08:47:57,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 297 treesize of output 284 [2023-11-23 08:47:57,494 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:47:57,494 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:47:57,545 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 08:47:57,545 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 229 treesize of output 258 [2023-11-23 08:47:57,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:47:57,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 276 [2023-11-23 08:47:57,572 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 235 treesize of output 223 [2023-11-23 08:47:57,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:47:57,588 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 324 treesize of output 322 [2023-11-23 08:47:57,599 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 281 treesize of output 269 [2023-11-23 08:47:57,617 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:47:57,663 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:47:58,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:47:58,083 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 85 treesize of output 91 [2023-11-23 08:47:58,135 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:47:58,136 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:47:58,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:47:58,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 109 [2023-11-23 08:47:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2023-11-23 08:47:58,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065443979] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:47:58,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:47:58,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 23 [2023-11-23 08:47:58,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347958479] [2023-11-23 08:47:58,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:47:58,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-23 08:47:58,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:47:58,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-23 08:47:58,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=362, Unknown=2, NotChecked=78, Total=506 [2023-11-23 08:47:58,225 INFO L87 Difference]: Start difference. First operand 159 states and 221 transitions. Second operand has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 22 states have internal predecessors, (79), 9 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2023-11-23 08:47:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:47:59,712 INFO L93 Difference]: Finished difference Result 318 states and 460 transitions. [2023-11-23 08:47:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-23 08:47:59,712 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 22 states have internal predecessors, (79), 9 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) Word has length 66 [2023-11-23 08:47:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:47:59,716 INFO L225 Difference]: With dead ends: 318 [2023-11-23 08:47:59,716 INFO L226 Difference]: Without dead ends: 248 [2023-11-23 08:47:59,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 120 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=159, Invalid=1037, Unknown=2, NotChecked=134, Total=1332 [2023-11-23 08:47:59,718 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 83 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 345 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:47:59,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 991 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 884 Invalid, 0 Unknown, 345 Unchecked, 1.0s Time] [2023-11-23 08:47:59,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-23 08:47:59,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 230. [2023-11-23 08:47:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 171 states have (on average 1.391812865497076) internal successors, (238), 179 states have internal predecessors, (238), 39 states have call successors, (39), 14 states have call predecessors, (39), 19 states have return successors, (48), 36 states have call predecessors, (48), 36 states have call successors, (48) [2023-11-23 08:47:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2023-11-23 08:47:59,747 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 325 transitions. Word has length 66 [2023-11-23 08:47:59,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:47:59,747 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 325 transitions. [2023-11-23 08:47:59,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 22 states have internal predecessors, (79), 9 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2023-11-23 08:47:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2023-11-23 08:47:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 08:47:59,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:47:59,748 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:47:59,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-23 08:47:59,961 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:47:59,962 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:47:59,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:47:59,962 INFO L85 PathProgramCache]: Analyzing trace with hash -57272850, now seen corresponding path program 1 times [2023-11-23 08:47:59,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:47:59,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694061258] [2023-11-23 08:47:59,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:47:59,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:47:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:48:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 08:48:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:48:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:48:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:48:00,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:00,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694061258] [2023-11-23 08:48:00,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694061258] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:00,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064135934] [2023-11-23 08:48:00,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:00,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:00,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:00,106 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:00,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 08:48:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 08:48:00,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:48:00,285 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:00,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064135934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:00,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:00,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 08:48:00,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127665531] [2023-11-23 08:48:00,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:00,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:48:00,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:00,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:48:00,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:48:00,287 INFO L87 Difference]: Start difference. First operand 230 states and 325 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:00,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:00,392 INFO L93 Difference]: Finished difference Result 447 states and 637 transitions. [2023-11-23 08:48:00,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:48:00,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2023-11-23 08:48:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:00,394 INFO L225 Difference]: With dead ends: 447 [2023-11-23 08:48:00,394 INFO L226 Difference]: Without dead ends: 248 [2023-11-23 08:48:00,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:48:00,395 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 33 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:00,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 236 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:48:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-23 08:48:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 230. [2023-11-23 08:48:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 171 states have (on average 1.3859649122807018) internal successors, (237), 179 states have internal predecessors, (237), 39 states have call successors, (39), 14 states have call predecessors, (39), 19 states have return successors, (48), 36 states have call predecessors, (48), 36 states have call successors, (48) [2023-11-23 08:48:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2023-11-23 08:48:00,430 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 67 [2023-11-23 08:48:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:00,430 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2023-11-23 08:48:00,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2023-11-23 08:48:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 08:48:00,431 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:00,431 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:00,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:00,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:00,641 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:00,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:00,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1702565189, now seen corresponding path program 1 times [2023-11-23 08:48:00,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:00,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926465683] [2023-11-23 08:48:00,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:00,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:48:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:48:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:48:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:48:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 08:48:00,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:00,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926465683] [2023-11-23 08:48:00,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926465683] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:00,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780171188] [2023-11-23 08:48:00,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:00,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:00,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:00,784 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:00,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 08:48:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:00,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:48:00,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:48:00,966 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:00,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780171188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:00,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:00,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2023-11-23 08:48:00,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297507991] [2023-11-23 08:48:00,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:00,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:48:00,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:00,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:48:00,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:48:00,971 INFO L87 Difference]: Start difference. First operand 230 states and 324 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:01,112 INFO L93 Difference]: Finished difference Result 499 states and 716 transitions. [2023-11-23 08:48:01,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:48:01,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2023-11-23 08:48:01,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:01,114 INFO L225 Difference]: With dead ends: 499 [2023-11-23 08:48:01,114 INFO L226 Difference]: Without dead ends: 299 [2023-11-23 08:48:01,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:48:01,115 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 57 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:01,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 278 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:48:01,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-23 08:48:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 234. [2023-11-23 08:48:01,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 175 states have (on average 1.3942857142857144) internal successors, (244), 183 states have internal predecessors, (244), 39 states have call successors, (39), 14 states have call predecessors, (39), 19 states have return successors, (48), 36 states have call predecessors, (48), 36 states have call successors, (48) [2023-11-23 08:48:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 331 transitions. [2023-11-23 08:48:01,131 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 331 transitions. Word has length 69 [2023-11-23 08:48:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:01,131 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 331 transitions. [2023-11-23 08:48:01,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 331 transitions. [2023-11-23 08:48:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:48:01,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:01,133 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:01,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:01,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-23 08:48:01,346 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:01,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:01,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1016775404, now seen corresponding path program 1 times [2023-11-23 08:48:01,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:01,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230123125] [2023-11-23 08:48:01,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:01,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:01,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:01,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:01,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:01,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:48:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:01,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:48:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:01,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:48:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:01,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 08:48:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 08:48:01,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:01,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230123125] [2023-11-23 08:48:01,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230123125] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:01,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195556437] [2023-11-23 08:48:01,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:01,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:01,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:01,520 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:01,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 08:48:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:01,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 08:48:01,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 08:48:01,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:01,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195556437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:01,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:01,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-23 08:48:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358776111] [2023-11-23 08:48:01,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:01,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 08:48:01,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:01,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 08:48:01,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:48:01,673 INFO L87 Difference]: Start difference. First operand 234 states and 331 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:01,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:01,709 INFO L93 Difference]: Finished difference Result 471 states and 696 transitions. [2023-11-23 08:48:01,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 08:48:01,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2023-11-23 08:48:01,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:01,712 INFO L225 Difference]: With dead ends: 471 [2023-11-23 08:48:01,712 INFO L226 Difference]: Without dead ends: 268 [2023-11-23 08:48:01,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:48:01,714 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 4 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:01,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 130 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:48:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-11-23 08:48:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 244. [2023-11-23 08:48:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 193 states have internal predecessors, (257), 39 states have call successors, (39), 14 states have call predecessors, (39), 19 states have return successors, (48), 36 states have call predecessors, (48), 36 states have call successors, (48) [2023-11-23 08:48:01,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 344 transitions. [2023-11-23 08:48:01,734 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 344 transitions. Word has length 70 [2023-11-23 08:48:01,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:01,734 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 344 transitions. [2023-11-23 08:48:01,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:01,734 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 344 transitions. [2023-11-23 08:48:01,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 08:48:01,735 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:01,735 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:01,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-23 08:48:01,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 08:48:01,948 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:01,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:01,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2000523247, now seen corresponding path program 1 times [2023-11-23 08:48:01,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:01,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243505169] [2023-11-23 08:48:01,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:01,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:02,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:02,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:02,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:02,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:02,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:48:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:02,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:48:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:02,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:48:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:02,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:48:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:48:02,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:02,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243505169] [2023-11-23 08:48:02,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243505169] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:02,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043092860] [2023-11-23 08:48:02,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:02,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:02,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:02,121 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:02,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 08:48:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:02,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-23 08:48:02,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:02,355 INFO L349 Elim1Store]: treesize reduction 42, result has 31.1 percent of original size [2023-11-23 08:48:02,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 80 [2023-11-23 08:48:02,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-11-23 08:48:02,390 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:48:02,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-23 08:48:02,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 08:48:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:48:02,811 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:02,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043092860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:02,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:02,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2023-11-23 08:48:02,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680780371] [2023-11-23 08:48:02,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:02,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:48:02,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:02,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:48:02,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-11-23 08:48:02,813 INFO L87 Difference]: Start difference. First operand 244 states and 344 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-23 08:48:04,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:06,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:08,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:10,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:12,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:13,280 INFO L93 Difference]: Finished difference Result 339 states and 480 transitions. [2023-11-23 08:48:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 08:48:13,281 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 77 [2023-11-23 08:48:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:13,282 INFO L225 Difference]: With dead ends: 339 [2023-11-23 08:48:13,282 INFO L226 Difference]: Without dead ends: 248 [2023-11-23 08:48:13,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:48:13,283 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 77 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 22 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:13,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 461 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 294 Invalid, 5 Unknown, 0 Unchecked, 10.4s Time] [2023-11-23 08:48:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-23 08:48:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2023-11-23 08:48:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 186 states have (on average 1.3763440860215055) internal successors, (256), 194 states have internal predecessors, (256), 39 states have call successors, (39), 14 states have call predecessors, (39), 19 states have return successors, (48), 36 states have call predecessors, (48), 36 states have call successors, (48) [2023-11-23 08:48:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 343 transitions. [2023-11-23 08:48:13,299 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 343 transitions. Word has length 77 [2023-11-23 08:48:13,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:13,299 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 343 transitions. [2023-11-23 08:48:13,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-23 08:48:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 343 transitions. [2023-11-23 08:48:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 08:48:13,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:13,301 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:13,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-23 08:48:13,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 08:48:13,513 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:13,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:13,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1098023147, now seen corresponding path program 1 times [2023-11-23 08:48:13,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:13,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518000363] [2023-11-23 08:48:13,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:13,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:13,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:13,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:13,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:13,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:48:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:13,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:48:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:13,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:48:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:13,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:48:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:48:13,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:13,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518000363] [2023-11-23 08:48:13,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518000363] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:13,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026410633] [2023-11-23 08:48:13,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:13,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:13,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:13,728 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:13,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 08:48:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:13,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-23 08:48:13,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:13,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:48:13,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:48:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 08:48:14,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:48:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:48:14,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026410633] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:48:14,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:48:14,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 12] total 26 [2023-11-23 08:48:14,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184904043] [2023-11-23 08:48:14,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:48:14,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 08:48:14,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:14,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 08:48:14,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2023-11-23 08:48:14,768 INFO L87 Difference]: Start difference. First operand 245 states and 343 transitions. Second operand has 26 states, 24 states have (on average 4.541666666666667) internal successors, (109), 24 states have internal predecessors, (109), 7 states have call successors, (19), 3 states have call predecessors, (19), 8 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2023-11-23 08:48:16,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:18,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:20,453 INFO L93 Difference]: Finished difference Result 958 states and 1450 transitions. [2023-11-23 08:48:20,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-23 08:48:20,454 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.541666666666667) internal successors, (109), 24 states have internal predecessors, (109), 7 states have call successors, (19), 3 states have call predecessors, (19), 8 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) Word has length 77 [2023-11-23 08:48:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:20,457 INFO L225 Difference]: With dead ends: 958 [2023-11-23 08:48:20,457 INFO L226 Difference]: Without dead ends: 654 [2023-11-23 08:48:20,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 154 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=541, Invalid=3241, Unknown=0, NotChecked=0, Total=3782 [2023-11-23 08:48:20,459 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 316 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 77 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:20,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 911 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1096 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2023-11-23 08:48:20,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2023-11-23 08:48:20,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 458. [2023-11-23 08:48:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 349 states have (on average 1.3610315186246418) internal successors, (475), 361 states have internal predecessors, (475), 75 states have call successors, (75), 24 states have call predecessors, (75), 33 states have return successors, (118), 72 states have call predecessors, (118), 70 states have call successors, (118) [2023-11-23 08:48:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 668 transitions. [2023-11-23 08:48:20,517 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 668 transitions. Word has length 77 [2023-11-23 08:48:20,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:20,517 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 668 transitions. [2023-11-23 08:48:20,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.541666666666667) internal successors, (109), 24 states have internal predecessors, (109), 7 states have call successors, (19), 3 states have call predecessors, (19), 8 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2023-11-23 08:48:20,517 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 668 transitions. [2023-11-23 08:48:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 08:48:20,520 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:20,536 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:20,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-23 08:48:20,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-23 08:48:20,749 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:20,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:20,750 INFO L85 PathProgramCache]: Analyzing trace with hash -467174540, now seen corresponding path program 1 times [2023-11-23 08:48:20,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:20,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752986445] [2023-11-23 08:48:20,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:20,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:20,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:20,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:20,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:21,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:21,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 08:48:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:21,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:48:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:21,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:48:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:21,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:48:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-23 08:48:21,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:21,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752986445] [2023-11-23 08:48:21,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752986445] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:21,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700826327] [2023-11-23 08:48:21,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:21,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:21,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:21,044 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:21,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-23 08:48:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:21,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-23 08:48:21,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:21,252 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 26 treesize of output 1 [2023-11-23 08:48:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-23 08:48:21,802 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:21,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700826327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:21,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:21,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2023-11-23 08:48:21,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768100001] [2023-11-23 08:48:21,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:21,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:48:21,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:21,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:48:21,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:48:21,803 INFO L87 Difference]: Start difference. First operand 458 states and 668 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:48:23,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:25,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:27,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:29,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:31,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:32,238 INFO L93 Difference]: Finished difference Result 549 states and 790 transitions. [2023-11-23 08:48:32,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 08:48:32,239 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 79 [2023-11-23 08:48:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:32,241 INFO L225 Difference]: With dead ends: 549 [2023-11-23 08:48:32,241 INFO L226 Difference]: Without dead ends: 460 [2023-11-23 08:48:32,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2023-11-23 08:48:32,242 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 92 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 18 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:32,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 453 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 317 Invalid, 5 Unknown, 0 Unchecked, 10.3s Time] [2023-11-23 08:48:32,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2023-11-23 08:48:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 458. [2023-11-23 08:48:32,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 349 states have (on average 1.3581661891117478) internal successors, (474), 361 states have internal predecessors, (474), 75 states have call successors, (75), 24 states have call predecessors, (75), 33 states have return successors, (118), 72 states have call predecessors, (118), 70 states have call successors, (118) [2023-11-23 08:48:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 667 transitions. [2023-11-23 08:48:32,272 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 667 transitions. Word has length 79 [2023-11-23 08:48:32,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:32,273 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 667 transitions. [2023-11-23 08:48:32,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:48:32,273 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 667 transitions. [2023-11-23 08:48:32,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 08:48:32,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:32,274 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:32,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:32,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 08:48:32,487 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:32,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:32,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1203532176, now seen corresponding path program 1 times [2023-11-23 08:48:32,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:32,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480203776] [2023-11-23 08:48:32,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:32,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 08:48:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:48:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:48:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:48:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 08:48:32,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:32,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480203776] [2023-11-23 08:48:32,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480203776] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:32,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953676100] [2023-11-23 08:48:32,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:32,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:32,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:32,793 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:32,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-23 08:48:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:48:32,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 08:48:33,011 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:33,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953676100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:33,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:33,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2023-11-23 08:48:33,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858979386] [2023-11-23 08:48:33,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:33,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:48:33,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:33,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:48:33,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:48:33,013 INFO L87 Difference]: Start difference. First operand 458 states and 667 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:48:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:33,092 INFO L93 Difference]: Finished difference Result 885 states and 1278 transitions. [2023-11-23 08:48:33,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:48:33,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 79 [2023-11-23 08:48:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:33,094 INFO L225 Difference]: With dead ends: 885 [2023-11-23 08:48:33,094 INFO L226 Difference]: Without dead ends: 377 [2023-11-23 08:48:33,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-11-23 08:48:33,096 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 22 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:33,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 368 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:48:33,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-11-23 08:48:33,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2023-11-23 08:48:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 273 states have (on average 1.2747252747252746) internal successors, (348), 285 states have internal predecessors, (348), 70 states have call successors, (70), 24 states have call predecessors, (70), 33 states have return successors, (113), 67 states have call predecessors, (113), 65 states have call successors, (113) [2023-11-23 08:48:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 531 transitions. [2023-11-23 08:48:33,130 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 531 transitions. Word has length 79 [2023-11-23 08:48:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:33,130 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 531 transitions. [2023-11-23 08:48:33,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:48:33,130 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 531 transitions. [2023-11-23 08:48:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:48:33,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:33,132 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:33,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:33,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 08:48:33,344 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:33,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:33,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1753529238, now seen corresponding path program 1 times [2023-11-23 08:48:33,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:33,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049074558] [2023-11-23 08:48:33,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:33,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:48:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:48:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:48:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:48:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:48:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 08:48:33,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:33,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049074558] [2023-11-23 08:48:33,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049074558] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:33,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54991071] [2023-11-23 08:48:33,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:33,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:33,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:33,658 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:33,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-23 08:48:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-23 08:48:33,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:33,921 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2023-11-23 08:48:33,921 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2023-11-23 08:48:33,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-11-23 08:48:33,933 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:48:33,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-23 08:48:33,952 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:48:33,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2023-11-23 08:48:33,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 08:48:33,959 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2))) (and (not (= .cse0 0)) (or (= |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base| .cse0) (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0))) (= .cse1 (select (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_5) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base| (store .cse1 .cse2 .cse0)) .cse0)))))))) is different from true [2023-11-23 08:48:33,971 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) .cse3))) (and (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse2))) (= .cse1 (select (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| (store .cse1 .cse3 .cse2)) .cse2)))) (not (= .cse2 0))))))) is different from true [2023-11-23 08:48:34,134 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2))) (and (not (= .cse0 0)) (or (= |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base| .cse0) (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0))) (= .cse1 (select (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_5) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base| (store .cse1 .cse2 .cse0)) .cse0))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) (not (= .cse3 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| 24))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) .cse6))) (and (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse5))) (= .cse4 (select (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| (store .cse4 .cse6 .cse5)) .cse5)))) (not (= .cse5 0)))))))))) is different from true [2023-11-23 08:48:34,152 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) .cse3))) (and (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse2))) (= .cse1 (select (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| (store .cse1 .cse3 .cse2)) .cse2)))) (not (= .cse2 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_36| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51|) .cse6))) (and (not (= .cse4 0)) (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (= .cse5 (select (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51| (store .cse5 .cse6 .cse4)) .cse4)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_36| 24)))) (and (= .cse7 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51|) (not (= .cse7 0))))))) is different from true [2023-11-23 08:48:34,213 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2))) (and (not (= .cse0 0)) (or (= |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base| .cse0) (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0))) (= .cse1 (select (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_5) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base| (store .cse1 .cse2 .cse0)) .cse0))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) (not (= .cse3 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| 24))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) .cse6))) (and (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse5))) (= .cse4 (select (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| (store .cse4 .cse6 .cse5)) .cse5)))) (not (= .cse5 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_36| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51|) .cse9))) (and (not (= .cse7 0)) (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse7))) (= .cse8 (select (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51| (store .cse8 .cse9 .cse7)) .cse7)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_36| 24)))) (and (= .cse10 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51|) (not (= .cse10 0))))))))) is different from true [2023-11-23 08:48:34,334 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_15| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_14| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_15| .cse0) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_15| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_15|) .cse3))) (and (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (= (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_15| (store .cse2 .cse3 .cse1)) .cse1) .cse2))) (not (= .cse1 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) .cse7))) (and (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse6))) (= .cse5 (select (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| (store .cse5 .cse7 .cse6)) .cse6)))) (not (= .cse6 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_36| 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51|) .cse10))) (and (not (= .cse8 0)) (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (= .cse9 (select (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51| (store .cse9 .cse10 .cse8)) .cse8)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_36| 24)))) (and (= .cse11 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_51|) (not (= .cse11 0))))))) is different from true [2023-11-23 08:48:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2023-11-23 08:48:35,015 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:48:37,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:48:37,456 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 162 treesize of output 163 [2023-11-23 08:48:37,460 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 172 treesize of output 156 [2023-11-23 08:48:37,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 08:48:37,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 08:48:37,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-11-23 08:48:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 08:48:37,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54991071] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:48:37,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:48:37,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 10] total 27 [2023-11-23 08:48:37,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104011240] [2023-11-23 08:48:37,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:48:37,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-23 08:48:37,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:37,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-23 08:48:37,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=349, Unknown=28, NotChecked=258, Total=702 [2023-11-23 08:48:37,544 INFO L87 Difference]: Start difference. First operand 377 states and 531 transitions. Second operand has 27 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 10 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (20), 8 states have call predecessors, (20), 10 states have call successors, (20) [2023-11-23 08:48:39,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:40,771 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 0)) (.cse0 (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_~list#1.base|))) (and (or (not (= (select (select |c_#memory_$Pointer$.offset| |c_aws_linked_list_is_valid_~list#1.base|) |c_aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select .cse0 |c_aws_linked_list_is_valid_~list#1.offset|) 0))) (or .cse1 |c_aws_linked_list_is_valid_#t~short310#1|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| 24)))) (and (= .cse2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) (not (= .cse2 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) .cse5))) (and (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse4))) (= .cse3 (select (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| (store .cse3 .cse5 .cse4)) .cse4)))) (not (= .cse4 0))))))) (or .cse1 (not (= (select .cse0 (+ |c_aws_linked_list_is_valid_~list#1.offset| 24)) 0))))) is different from true [2023-11-23 08:48:44,033 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_35| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50|) .cse3))) (and (exists ((v_DerPreprocessor_5 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse2))) (= .cse1 (select (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_50| (store .cse1 .cse3 .cse2)) .cse2)))) (not (= .cse2 0))))))) (or (not (= |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| 0)) (not (= |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base| 0)))) is different from true [2023-11-23 08:48:49,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:55,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:57,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:57,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:57,548 INFO L93 Difference]: Finished difference Result 1263 states and 2003 transitions. [2023-11-23 08:48:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-11-23 08:48:57,548 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 10 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (20), 8 states have call predecessors, (20), 10 states have call successors, (20) Word has length 80 [2023-11-23 08:48:57,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:57,552 INFO L225 Difference]: With dead ends: 1263 [2023-11-23 08:48:57,552 INFO L226 Difference]: Without dead ends: 842 [2023-11-23 08:48:57,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=775, Invalid=3534, Unknown=145, NotChecked=1096, Total=5550 [2023-11-23 08:48:57,557 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 280 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 41 mSolverCounterUnsat, 185 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 4479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 185 IncrementalHoareTripleChecker+Unknown, 2882 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:57,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 874 Invalid, 4479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1371 Invalid, 185 Unknown, 2882 Unchecked, 15.1s Time] [2023-11-23 08:48:57,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2023-11-23 08:48:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 655. [2023-11-23 08:48:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 501 states have (on average 1.2934131736526946) internal successors, (648), 517 states have internal predecessors, (648), 106 states have call successors, (106), 32 states have call predecessors, (106), 47 states have return successors, (173), 105 states have call predecessors, (173), 101 states have call successors, (173) [2023-11-23 08:48:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 927 transitions. [2023-11-23 08:48:57,616 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 927 transitions. Word has length 80 [2023-11-23 08:48:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:57,616 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 927 transitions. [2023-11-23 08:48:57,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 10 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (20), 8 states have call predecessors, (20), 10 states have call successors, (20) [2023-11-23 08:48:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 927 transitions. [2023-11-23 08:48:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:48:57,620 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:57,620 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:57,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:57,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:57,835 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:57,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:57,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1695959392, now seen corresponding path program 1 times [2023-11-23 08:48:57,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:57,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020577518] [2023-11-23 08:48:57,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:57,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:57,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:57,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:57,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:48:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:57,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:57,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:48:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:57,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:48:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:57,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:48:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:57,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:48:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-23 08:48:57,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:57,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020577518] [2023-11-23 08:48:57,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020577518] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:57,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765427143] [2023-11-23 08:48:57,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:57,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:57,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:57,928 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:57,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-23 08:48:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:58,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:48:58,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-23 08:48:58,140 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:58,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765427143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:58,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:58,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 08:48:58,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500430335] [2023-11-23 08:48:58,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:58,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:48:58,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:58,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:48:58,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:48:58,142 INFO L87 Difference]: Start difference. First operand 655 states and 927 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:48:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:58,219 INFO L93 Difference]: Finished difference Result 948 states and 1407 transitions. [2023-11-23 08:48:58,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:48:58,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2023-11-23 08:48:58,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:58,222 INFO L225 Difference]: With dead ends: 948 [2023-11-23 08:48:58,222 INFO L226 Difference]: Without dead ends: 639 [2023-11-23 08:48:58,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:48:58,224 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 8 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:58,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 208 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:48:58,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2023-11-23 08:48:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2023-11-23 08:48:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 485 states have (on average 1.2783505154639174) internal successors, (620), 501 states have internal predecessors, (620), 106 states have call successors, (106), 32 states have call predecessors, (106), 47 states have return successors, (163), 105 states have call predecessors, (163), 101 states have call successors, (163) [2023-11-23 08:48:58,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 889 transitions. [2023-11-23 08:48:58,275 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 889 transitions. Word has length 80 [2023-11-23 08:48:58,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:58,275 INFO L495 AbstractCegarLoop]: Abstraction has 639 states and 889 transitions. [2023-11-23 08:48:58,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:48:58,275 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 889 transitions. [2023-11-23 08:48:58,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:48:58,277 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:58,277 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:58,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-23 08:48:58,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-23 08:48:58,490 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:58,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:58,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1774933150, now seen corresponding path program 1 times [2023-11-23 08:48:58,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:58,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999214001] [2023-11-23 08:48:58,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:58,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:58,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:58,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:58,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:48:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:58,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:58,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:48:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:58,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:48:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:58,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:48:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:58,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:48:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-23 08:48:58,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:58,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999214001] [2023-11-23 08:48:58,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999214001] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:58,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850884543] [2023-11-23 08:48:58,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:58,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:58,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:58,585 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:48:58,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-23 08:48:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:58,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:48:58,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-23 08:48:58,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:58,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850884543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:58,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:58,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 08:48:58,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620125598] [2023-11-23 08:48:58,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:58,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:48:58,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:58,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:48:58,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:48:58,769 INFO L87 Difference]: Start difference. First operand 639 states and 889 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:48:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:58,837 INFO L93 Difference]: Finished difference Result 812 states and 1155 transitions. [2023-11-23 08:48:58,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:48:58,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2023-11-23 08:48:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:58,839 INFO L225 Difference]: With dead ends: 812 [2023-11-23 08:48:58,839 INFO L226 Difference]: Without dead ends: 367 [2023-11-23 08:48:58,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:48:58,841 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 2 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:58,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 198 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:48:58,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-11-23 08:48:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2023-11-23 08:48:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 275 states have (on average 1.1927272727272726) internal successors, (328), 283 states have internal predecessors, (328), 62 states have call successors, (62), 22 states have call predecessors, (62), 29 states have return successors, (77), 61 states have call predecessors, (77), 59 states have call successors, (77) [2023-11-23 08:48:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 467 transitions. [2023-11-23 08:48:58,871 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 467 transitions. Word has length 80 [2023-11-23 08:48:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:58,871 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 467 transitions. [2023-11-23 08:48:58,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:48:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 467 transitions. [2023-11-23 08:48:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 08:48:58,873 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:58,873 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:48:58,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-23 08:48:59,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-23 08:48:59,086 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:59,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:59,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1076603965, now seen corresponding path program 1 times [2023-11-23 08:48:59,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:59,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087552836] [2023-11-23 08:48:59,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:59,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:59,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:59,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:59,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:48:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:59,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:48:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:59,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 08:48:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:59,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:48:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:59,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:48:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:59,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 08:48:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:59,540 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 08:48:59,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:59,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087552836] [2023-11-23 08:48:59,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087552836] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:59,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160458586] [2023-11-23 08:48:59,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:59,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:59,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:59,542 INFO L229 MonitoredProcess]: Starting monitored process 18 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:59,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-23 08:48:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:59,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-23 08:48:59,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:59,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:59,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:59,826 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 18 [2023-11-23 08:48:59,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:59,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-23 08:48:59,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-23 08:49:01,854 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_58| Int)) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_58|) 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_58|)) is different from true [2023-11-23 08:49:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:49:26,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:49:36,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160458586] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:49:36,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:49:36,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2023-11-23 08:49:36,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454803095] [2023-11-23 08:49:36,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:49:36,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-23 08:49:36,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:36,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-23 08:49:36,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1021, Unknown=14, NotChecked=64, Total=1190 [2023-11-23 08:49:36,968 INFO L87 Difference]: Start difference. First operand 367 states and 467 transitions. Second operand has 29 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 26 states have internal predecessors, (100), 8 states have call successors, (17), 3 states have call predecessors, (17), 6 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2023-11-23 08:49:38,994 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:41,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:49:45,119 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:47,200 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:49,213 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:53,250 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:55,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:05,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:09,429 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:11,445 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:13,460 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:15,472 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:17,489 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:19,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:27,543 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:29,548 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:31,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:45,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:50:47,647 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:49,663 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:53,701 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:55,706 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:57,716 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:59,739 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:51:01,764 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:51:03,783 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:51:05,786 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:51:07,797 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:51:09,851 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:51:11,854 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:51:13,861 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:51:15,894 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:51:17,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:51:27,981 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:51:29,994 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:51:32,036 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:51:34,050 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:51:44,089 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:51:46,120 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:51:48,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:51:50,138 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:51:52,219 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:51:58,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:04,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15