./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_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_rbegin_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 49ed7f3e9a0a6ed433709b0bb1effeae8bd9acd1921ce556b935c6a1999ca674 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:53:25,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:53:25,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:53:25,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:53:25,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:53:25,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:53:25,316 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:53:25,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:53:25,317 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:53:25,321 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:53:25,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:53:25,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:53:25,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:53:25,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:53:25,324 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:53:25,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:53:25,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:53:25,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:53:25,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:53:25,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:53:25,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:53:25,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:53:25,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:53:25,326 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:53:25,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:53:25,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:53:25,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:53:25,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:53:25,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:53:25,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:53:25,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:53:25,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:53:25,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:53:25,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:53:25,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:53:25,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:53:25,330 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:53:25,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:53:25,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:53:25,331 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 -> 49ed7f3e9a0a6ed433709b0bb1effeae8bd9acd1921ce556b935c6a1999ca674 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:53:25,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:53:25,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:53:25,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:53:25,636 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:53:25,636 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:53:25,637 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_rbegin_harness_negated.i [2023-11-23 08:53:26,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:53:27,200 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:53:27,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i [2023-11-23 08:53:27,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cac87109/41f2b511882346368f8209b51806c5f2/FLAGeeecaf1c4 [2023-11-23 08:53:27,249 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cac87109/41f2b511882346368f8209b51806c5f2 [2023-11-23 08:53:27,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:53:27,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:53:27,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:53:27,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:53:27,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:53:27,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:53:27" (1/1) ... [2023-11-23 08:53:27,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c92b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:27, skipping insertion in model container [2023-11-23 08:53:27,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:53:27" (1/1) ... [2023-11-23 08:53:27,355 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:53:27,597 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_rbegin_harness_negated.i[4496,4509] [2023-11-23 08:53:27,606 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_rbegin_harness_negated.i[4556,4569] [2023-11-23 08:53:28,344 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,345 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,345 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,346 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,347 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,360 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,360 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,362 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,362 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,364 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,365 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,365 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,365 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,637 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:53:28,638 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:53:28,639 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:53:28,640 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:53:28,642 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:53:28,643 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:53:28,644 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:53:28,645 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:53:28,645 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:53:28,657 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:53:28,837 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:53:28,857 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:53:28,877 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_rbegin_harness_negated.i[4496,4509] [2023-11-23 08:53:28,878 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_rbegin_harness_negated.i[4556,4569] [2023-11-23 08:53:28,955 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,957 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,957 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,958 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,958 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,970 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,971 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,972 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,973 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,973 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,974 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,975 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:28,975 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:29,019 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:53:29,020 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:53:29,021 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:53:29,021 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:53:29,022 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:53:29,022 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:53:29,023 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:53:29,024 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:53:29,025 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:53:29,025 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:53:29,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:53:29,234 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:29,235 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:29,235 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:29,235 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:29,235 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:29,236 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:29,236 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:29,236 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:29,236 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:29,236 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:29,236 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:29,237 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:29,237 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:29,237 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:29,238 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:29,238 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:29,245 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:53:29,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:29 WrapperNode [2023-11-23 08:53:29,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:53:29,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:53:29,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:53:29,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:53:29,254 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:53:29" (1/1) ... [2023-11-23 08:53:29,312 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:53:29" (1/1) ... [2023-11-23 08:53:29,351 INFO L138 Inliner]: procedures = 678, calls = 1041, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 141 [2023-11-23 08:53:29,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:53:29,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:53:29,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:53:29,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:53:29,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:29" (1/1) ... [2023-11-23 08:53:29,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:29" (1/1) ... [2023-11-23 08:53:29,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:29" (1/1) ... [2023-11-23 08:53:29,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:29" (1/1) ... [2023-11-23 08:53:29,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:29" (1/1) ... [2023-11-23 08:53:29,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:29" (1/1) ... [2023-11-23 08:53:29,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:29" (1/1) ... [2023-11-23 08:53:29,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:29" (1/1) ... [2023-11-23 08:53:29,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:53:29,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:53:29,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:53:29,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:53:29,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:29" (1/1) ... [2023-11-23 08:53:29,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:53:29,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:29,470 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:53:29,496 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:53:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:53:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:53:29,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:53:29,546 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:53:29,546 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:53:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:53:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 08:53:29,547 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 08:53:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:53:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:53:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:53:29,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:53:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:53:29,548 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:53:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:53:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:53:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:53:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:53:29,549 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:53:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:53:29,774 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:53:29,777 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:53:29,955 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:53:30,016 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:53:30,017 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 08:53:30,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:53:30 BoogieIcfgContainer [2023-11-23 08:53:30,018 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:53:30,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:53:30,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:53:30,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:53:30,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:53:27" (1/3) ... [2023-11-23 08:53:30,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1765645d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:53:30, skipping insertion in model container [2023-11-23 08:53:30,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:29" (2/3) ... [2023-11-23 08:53:30,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1765645d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:53:30, skipping insertion in model container [2023-11-23 08:53:30,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:53:30" (3/3) ... [2023-11-23 08:53:30,034 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness_negated.i [2023-11-23 08:53:30,051 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:53:30,052 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:53:30,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:53:30,102 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;@478fa118, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:53:30,102 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:53:30,105 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:53:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:53:30,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:30,116 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:53:30,117 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:30,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:30,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1769392804, now seen corresponding path program 1 times [2023-11-23 08:53:30,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:30,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272386162] [2023-11-23 08:53:30,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:30,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:30,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:30,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:53:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:30,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:53:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:30,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:53:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:30,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:53:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:30,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:53:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:30,643 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:53:30,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:30,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272386162] [2023-11-23 08:53:30,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272386162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:30,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:30,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 08:53:30,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027272112] [2023-11-23 08:53:30,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:30,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:53:30,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:30,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:53:30,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:53:30,704 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:53:30,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:30,768 INFO L93 Difference]: Finished difference Result 114 states and 170 transitions. [2023-11-23 08:53:30,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:53:30,770 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:53:30,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:30,778 INFO L225 Difference]: With dead ends: 114 [2023-11-23 08:53:30,779 INFO L226 Difference]: Without dead ends: 58 [2023-11-23 08:53:30,784 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:53:30,789 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:53:30,790 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:53:30,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-23 08:53:30,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-23 08:53:30,834 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:53:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2023-11-23 08:53:30,837 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 65 [2023-11-23 08:53:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:30,838 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2023-11-23 08:53:30,838 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:53:30,860 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2023-11-23 08:53:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:53:30,863 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:30,863 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:53:30,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:53:30,867 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:30,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:30,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1112295830, now seen corresponding path program 1 times [2023-11-23 08:53:30,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:30,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622222490] [2023-11-23 08:53:30,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:30,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:31,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:31,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:53:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:31,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:53:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:31,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:53:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:31,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:53:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:31,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:53:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:31,449 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:53:31,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:31,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622222490] [2023-11-23 08:53:31,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622222490] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:31,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088093149] [2023-11-23 08:53:31,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:31,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:31,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:31,452 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:53:31,474 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:53:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:31,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-23 08:53:31,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:31,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 08:53:31,794 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:53:31,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:31,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:31,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:31,925 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:53:31,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:31,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:31,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:31,937 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:53:32,746 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:53:32,747 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:32,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088093149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:32,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:53:32,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2023-11-23 08:53:32,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093405151] [2023-11-23 08:53:32,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:32,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:53:32,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:32,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:53:32,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:53:32,752 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:53:33,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:33,394 INFO L93 Difference]: Finished difference Result 160 states and 217 transitions. [2023-11-23 08:53:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:53:33,395 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:53:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:33,396 INFO L225 Difference]: With dead ends: 160 [2023-11-23 08:53:33,396 INFO L226 Difference]: Without dead ends: 110 [2023-11-23 08:53:33,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:53:33,398 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 43 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:33,399 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.5s Time] [2023-11-23 08:53:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-23 08:53:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2023-11-23 08:53:33,421 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:53:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2023-11-23 08:53:33,424 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 65 [2023-11-23 08:53:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:33,425 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2023-11-23 08:53:33,426 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:53:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2023-11-23 08:53:33,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:53:33,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:33,434 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:53:33,455 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:53:33,651 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:53:33,652 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:33,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:33,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1684399024, now seen corresponding path program 1 times [2023-11-23 08:53:33,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:33,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713492857] [2023-11-23 08:53:33,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:33,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:33,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:33,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:33,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:53:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:33,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:53:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:33,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:53:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:33,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:53:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:33,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:53:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:33,968 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:53:33,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:33,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713492857] [2023-11-23 08:53:33,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713492857] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:33,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106866241] [2023-11-23 08:53:33,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:33,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:33,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:33,973 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:53:33,991 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:53:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-23 08:53:34,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:34,229 INFO L349 Elim1Store]: treesize reduction 42, result has 31.1 percent of original size [2023-11-23 08:53:34,230 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:53:34,239 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:53:34,286 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:53:34,288 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:53:34,291 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:53:36,442 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_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))) (let ((.cse1 (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_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|))) (and (= (store .cse1 .cse2 .cse0) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) .cse1)))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse5 (select .cse3 .cse4))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) (= .cse3 (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) .cse4 .cse5)) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| .cse5)))))))) is different from true [2023-11-23 08:53:39,053 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_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))) (let ((.cse1 (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_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|))) (and (= (store .cse1 .cse2 .cse0) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) .cse1)))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse5 (select .cse3 .cse4))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) (= .cse3 (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) .cse4 .cse5)) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| .cse5)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse8))) (and (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| .cse6) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (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_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|))) (and (= (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) .cse7) (= (store .cse7 .cse8 .cse6) v_DerPreprocessor_2)))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (let ((.cse11 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse10 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse9 (select .cse11 .cse10))) (and (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| .cse9) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) (= (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) .cse10 .cse9) .cse11))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|))))) is different from true [2023-11-23 08:53:43,880 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_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))) (let ((.cse1 (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_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|))) (and (= (store .cse1 .cse2 .cse0) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) .cse1)))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse5 (select .cse3 .cse4))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) (= .cse3 (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) .cse4 .cse5)) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| .cse5)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse8))) (and (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| .cse6) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (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_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|))) (and (= (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) .cse7) (= (store .cse7 .cse8 .cse6) v_DerPreprocessor_2)))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (let ((.cse11 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse10 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse9 (select .cse11 .cse10))) (and (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| .cse9) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) (= (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) .cse10 .cse9) .cse11))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|) .cse13))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse12 (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_rbegin_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|))) (and (= v_DerPreprocessor_2 (store .cse12 .cse13 .cse14)) (= .cse12 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|))))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| |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| .cse14))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (let ((.cse15 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|)) (.cse16 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse17 (select .cse15 .cse16))) (and (= .cse15 (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|) .cse16 .cse17)) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| |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| .cse17))))))))) is different from true [2023-11-23 08:53:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-23 08:53:52,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:53:56,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:56,670 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 238 treesize of output 232 [2023-11-23 08:53:56,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 146 [2023-11-23 08:53:56,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 117 [2023-11-23 08:53:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:53:56,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106866241] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:53:56,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:53:56,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 10] total 27 [2023-11-23 08:53:56,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077288303] [2023-11-23 08:53:56,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:53:56,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-23 08:53:56,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:56,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-23 08:53:56,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=482, Unknown=8, NotChecked=138, Total=702 [2023-11-23 08:53:56,988 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 27 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 23 states have internal predecessors, (87), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-23 08:54:00,209 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:54:02,235 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:54:08,890 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:54:10,967 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:54:12,974 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:54:15,002 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:54:21,155 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:54:23,268 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:54:25,289 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:54:33,516 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:54:35,528 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:54:37,536 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:54:39,557 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:54:41,589 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:54:43,595 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:54:51,720 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:54:53,792 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:54:55,796 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:54:57,802 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:54:59,808 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:55:01,815 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:55:03,819 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:55:14,035 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:55:20,107 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:55:22,110 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:55:24,113 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:55:26,116 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:55:28,151 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:55:30,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:55:38,268 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:55:40,324 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:55:42,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:55:44,531 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:55:46,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:55:48,547 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:55:50,597 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:55:52,673 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:55:54,696 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:55:56,710 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:55:58,717 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:56:00,733 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:56:08,811 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:56:10,825 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:56:12,837 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:56:14,841 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:56:16,853 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:56:18,858 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:56:20,940 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:56:22,944 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:56:24,953 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:56:26,958 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:56:28,968 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:56:30,983 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:56:37,226 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:56:39,246 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:56:41,294 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:56:43,302 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:56:45,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:56:47,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:56:49,363 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:56:51,425 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:56:53,431 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:56:55,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:56:57,452 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:56:59,474 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:57:01,484 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:57:03,495 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:57:05,524 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:57:07,547 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:57:09,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:57:11,606 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:57:13,685 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:57:15,696 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:57:17,916 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:57:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:17,921 INFO L93 Difference]: Finished difference Result 249 states and 359 transitions. [2023-11-23 08:57:17,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-23 08:57:17,921 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 23 states have internal predecessors, (87), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) Word has length 65 [2023-11-23 08:57:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:17,925 INFO L225 Difference]: With dead ends: 249 [2023-11-23 08:57:17,925 INFO L226 Difference]: Without dead ends: 138 [2023-11-23 08:57:17,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 69.4s TimeCoverageRelationStatistics Valid=173, Invalid=1145, Unknown=26, NotChecked=216, Total=1560 [2023-11-23 08:57:17,927 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 62 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 25 mSolverCounterUnsat, 75 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 151.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 75 IncrementalHoareTripleChecker+Unknown, 487 IncrementalHoareTripleChecker+Unchecked, 151.6s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:17,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 966 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 790 Invalid, 75 Unknown, 487 Unchecked, 151.6s Time] [2023-11-23 08:57:17,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-23 08:57:17,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2023-11-23 08:57:17,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 82 states have internal predecessors, (104), 24 states have call successors, (24), 9 states have call predecessors, (24), 11 states have return successors, (28), 22 states have call predecessors, (28), 22 states have call successors, (28) [2023-11-23 08:57:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2023-11-23 08:57:17,945 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 65 [2023-11-23 08:57:17,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:17,945 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2023-11-23 08:57:17,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 23 states have internal predecessors, (87), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-23 08:57:17,946 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2023-11-23 08:57:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 08:57:17,947 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:17,947 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] [2023-11-23 08:57:17,960 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:57:18,148 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:57:18,148 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:18,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:18,149 INFO L85 PathProgramCache]: Analyzing trace with hash -959772950, now seen corresponding path program 1 times [2023-11-23 08:57:18,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:57:18,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275658167] [2023-11-23 08:57:18,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:18,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:57:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:18,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:57:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:18,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:57:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:18,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:57:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:18,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:57:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:18,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 08:57:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:18,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:57:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:18,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:57:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:18,398 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:57:18,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:57:18,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275658167] [2023-11-23 08:57:18,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275658167] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:57:18,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741194444] [2023-11-23 08:57:18,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:18,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:18,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:57:18,400 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:57:18,403 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:57:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:18,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 08:57:18,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:18,606 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:57:18,606 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:57:18,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741194444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:57:18,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:57:18,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 08:57:18,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906230877] [2023-11-23 08:57:18,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:57:18,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:57:18,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:57:18,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:57:18,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:57:18,610 INFO L87 Difference]: Start difference. First operand 114 states and 156 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:57:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:18,731 INFO L93 Difference]: Finished difference Result 221 states and 306 transitions. [2023-11-23 08:57:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:57:18,732 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:57:18,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:18,734 INFO L225 Difference]: With dead ends: 221 [2023-11-23 08:57:18,734 INFO L226 Difference]: Without dead ends: 120 [2023-11-23 08:57:18,735 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:57:18,735 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 33 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:57:18,736 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:57:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-23 08:57:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-23 08:57:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 88 states have internal predecessors, (108), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 08:57:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 164 transitions. [2023-11-23 08:57:18,752 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 164 transitions. Word has length 67 [2023-11-23 08:57:18,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:18,753 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 164 transitions. [2023-11-23 08:57:18,753 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:57:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 164 transitions. [2023-11-23 08:57:18,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 08:57:18,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:18,754 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] [2023-11-23 08:57:18,772 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:57:18,964 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:57:18,964 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:18,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:18,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1689902007, now seen corresponding path program 1 times [2023-11-23 08:57:18,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:57:18,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816920904] [2023-11-23 08:57:18,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:18,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:57:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:19,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:57:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:19,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:57:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:19,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:57:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:19,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:57:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:19,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:57:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:19,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:57:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:19,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:57:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:19,244 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:57:19,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:57:19,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816920904] [2023-11-23 08:57:19,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816920904] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:57:19,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693710654] [2023-11-23 08:57:19,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:19,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:19,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:57:19,246 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:57:19,264 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:57:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:19,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:57:19,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:19,490 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:57:19,490 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:57:19,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693710654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:57:19,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:57:19,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2023-11-23 08:57:19,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552883722] [2023-11-23 08:57:19,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:57:19,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:57:19,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:57:19,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:57:19,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:57:19,493 INFO L87 Difference]: Start difference. First operand 120 states and 164 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:57:19,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:19,651 INFO L93 Difference]: Finished difference Result 247 states and 344 transitions. [2023-11-23 08:57:19,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:57:19,652 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:57:19,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:19,653 INFO L225 Difference]: With dead ends: 247 [2023-11-23 08:57:19,653 INFO L226 Difference]: Without dead ends: 140 [2023-11-23 08:57:19,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:57:19,655 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:57:19,655 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:57:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-23 08:57:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 124. [2023-11-23 08:57:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 92 states have internal predecessors, (114), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 08:57:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2023-11-23 08:57:19,673 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 69 [2023-11-23 08:57:19,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:19,673 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2023-11-23 08:57:19,674 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:57:19,674 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2023-11-23 08:57:19,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:57:19,675 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:19,675 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] [2023-11-23 08:57:19,696 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:57:19,888 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:57:19,888 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:19,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:19,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1919275504, now seen corresponding path program 1 times [2023-11-23 08:57:19,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:57:19,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749807762] [2023-11-23 08:57:19,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:19,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:57:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:19,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:57:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:19,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:57:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:19,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:57:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:19,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:57:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:19,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:57:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:19,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:57:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:20,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 08:57:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:20,018 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:57:20,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:57:20,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749807762] [2023-11-23 08:57:20,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749807762] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:57:20,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306021156] [2023-11-23 08:57:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:20,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:20,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:57:20,021 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:57:20,025 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:57:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:20,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 08:57:20,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:20,187 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:57:20,187 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:57:20,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306021156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:57:20,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:57:20,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-11-23 08:57:20,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702884968] [2023-11-23 08:57:20,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:57:20,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 08:57:20,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:57:20,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 08:57:20,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:57:20,190 INFO L87 Difference]: Start difference. First operand 124 states and 170 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:57:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:20,231 INFO L93 Difference]: Finished difference Result 245 states and 346 transitions. [2023-11-23 08:57:20,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 08:57:20,231 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:57:20,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:20,235 INFO L225 Difference]: With dead ends: 245 [2023-11-23 08:57:20,235 INFO L226 Difference]: Without dead ends: 134 [2023-11-23 08:57:20,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:57:20,238 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:57:20,238 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:57:20,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-23 08:57:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2023-11-23 08:57:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 94 states have internal predecessors, (116), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 08:57:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 172 transitions. [2023-11-23 08:57:20,263 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 172 transitions. Word has length 70 [2023-11-23 08:57:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:20,263 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 172 transitions. [2023-11-23 08:57:20,263 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:57:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 172 transitions. [2023-11-23 08:57:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 08:57:20,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:20,265 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:57:20,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-23 08:57:20,481 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:57:20,482 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:20,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1098023147, now seen corresponding path program 1 times [2023-11-23 08:57:20,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:57:20,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113123833] [2023-11-23 08:57:20,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:20,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:57:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:20,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:57:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:20,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:57:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:20,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:57:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:20,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:57:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:20,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:57:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:20,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:57:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:20,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:57:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:20,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:57:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:20,728 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:57:20,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:57:20,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113123833] [2023-11-23 08:57:20,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113123833] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:57:20,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865390143] [2023-11-23 08:57:20,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:20,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:20,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:57:20,730 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:57:20,733 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:57:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:20,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-23 08:57:20,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:20,939 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:57:20,941 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:57:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:57:21,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:57:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:57:22,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865390143] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:57:22,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:57:22,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 12] total 26 [2023-11-23 08:57:22,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848231025] [2023-11-23 08:57:22,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:57:22,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 08:57:22,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:57:22,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 08:57:22,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2023-11-23 08:57:22,145 INFO L87 Difference]: Start difference. First operand 126 states and 172 transitions. Second operand has 26 states, 25 states have (on average 4.28) internal successors, (107), 24 states have internal predecessors, (107), 7 states have call successors, (21), 3 states have call predecessors, (21), 7 states have return successors, (21), 7 states have call predecessors, (21), 7 states have call successors, (21) [2023-11-23 08:57:24,819 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:57:26,823 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:57:29,399 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:57:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:30,681 INFO L93 Difference]: Finished difference Result 587 states and 877 transitions. [2023-11-23 08:57:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-23 08:57:30,682 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.28) internal successors, (107), 24 states have internal predecessors, (107), 7 states have call successors, (21), 3 states have call predecessors, (21), 7 states have return successors, (21), 7 states have call predecessors, (21), 7 states have call successors, (21) Word has length 77 [2023-11-23 08:57:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:30,686 INFO L225 Difference]: With dead ends: 587 [2023-11-23 08:57:30,686 INFO L226 Difference]: Without dead ends: 444 [2023-11-23 08:57:30,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 150 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=541, Invalid=3241, Unknown=0, NotChecked=0, Total=3782 [2023-11-23 08:57:30,688 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 277 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 59 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:30,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1095 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1408 Invalid, 3 Unknown, 0 Unchecked, 7.6s Time] [2023-11-23 08:57:30,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2023-11-23 08:57:30,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 306. [2023-11-23 08:57:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 230 states have internal predecessors, (289), 58 states have call successors, (58), 19 states have call predecessors, (58), 28 states have return successors, (104), 56 states have call predecessors, (104), 54 states have call successors, (104) [2023-11-23 08:57:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 451 transitions. [2023-11-23 08:57:30,740 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 451 transitions. Word has length 77 [2023-11-23 08:57:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:30,741 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 451 transitions. [2023-11-23 08:57:30,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.28) internal successors, (107), 24 states have internal predecessors, (107), 7 states have call successors, (21), 3 states have call predecessors, (21), 7 states have return successors, (21), 7 states have call predecessors, (21), 7 states have call successors, (21) [2023-11-23 08:57:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 451 transitions. [2023-11-23 08:57:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 08:57:30,745 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:30,745 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:57:30,762 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:57:30,960 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:57:30,960 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:30,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:30,961 INFO L85 PathProgramCache]: Analyzing trace with hash -467174540, now seen corresponding path program 1 times [2023-11-23 08:57:30,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:57:30,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788143690] [2023-11-23 08:57:30,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:30,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:57:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:31,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:57:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:31,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:57:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:57:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:31,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:57:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:31,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 08:57:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:31,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:57:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:31,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:57:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:31,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:57:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:31,471 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:57:31,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:57:31,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788143690] [2023-11-23 08:57:31,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788143690] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:57:31,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405881387] [2023-11-23 08:57:31,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:31,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:31,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:57:31,473 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:57:31,480 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:57:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:31,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-23 08:57:31,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:31,753 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:57:32,373 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:57:32,373 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:57:32,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405881387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:57:32,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:57:32,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2023-11-23 08:57:32,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257026353] [2023-11-23 08:57:32,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:57:32,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:57:32,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:57:32,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:57:32,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:57:32,375 INFO L87 Difference]: Start difference. First operand 306 states and 451 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:57:34,384 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:57:36,408 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:57:38,436 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:57:40,459 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:57:42,472 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:57:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:42,890 INFO L93 Difference]: Finished difference Result 551 states and 827 transitions. [2023-11-23 08:57:42,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 08:57:42,892 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:57:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:42,896 INFO L225 Difference]: With dead ends: 551 [2023-11-23 08:57:42,896 INFO L226 Difference]: Without dead ends: 331 [2023-11-23 08:57:42,898 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:57:42,899 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 103 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 20 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:42,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 435 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 305 Invalid, 5 Unknown, 0 Unchecked, 10.4s Time] [2023-11-23 08:57:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-23 08:57:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 312. [2023-11-23 08:57:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 225 states have (on average 1.3111111111111111) internal successors, (295), 236 states have internal predecessors, (295), 58 states have call successors, (58), 19 states have call predecessors, (58), 28 states have return successors, (104), 56 states have call predecessors, (104), 54 states have call successors, (104) [2023-11-23 08:57:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 457 transitions. [2023-11-23 08:57:42,943 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 457 transitions. Word has length 79 [2023-11-23 08:57:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:42,943 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 457 transitions. [2023-11-23 08:57:42,943 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:57:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 457 transitions. [2023-11-23 08:57:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 08:57:42,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:42,945 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:57:42,965 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:57:43,162 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:57:43,163 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:43,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:43,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1203532176, now seen corresponding path program 1 times [2023-11-23 08:57:43,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:57:43,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539804845] [2023-11-23 08:57:43,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:43,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:57:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:43,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:57:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:43,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:57:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:43,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:57:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:43,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:57:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:43,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 08:57:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:43,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:57:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:43,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:57:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:43,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:57:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 08:57:43,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:57:43,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539804845] [2023-11-23 08:57:43,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539804845] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:57:43,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325251218] [2023-11-23 08:57:43,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:43,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:43,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:57:43,373 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:57:43,394 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:57:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:43,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:57:43,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:43,591 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:57:43,592 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:57:43,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325251218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:57:43,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:57:43,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 08:57:43,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967287681] [2023-11-23 08:57:43,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:57:43,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:57:43,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:57:43,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:57:43,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:57:43,596 INFO L87 Difference]: Start difference. First operand 312 states and 457 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:57:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:43,687 INFO L93 Difference]: Finished difference Result 745 states and 1128 transitions. [2023-11-23 08:57:43,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:57:43,688 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:57:43,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:43,693 INFO L225 Difference]: With dead ends: 745 [2023-11-23 08:57:43,693 INFO L226 Difference]: Without dead ends: 299 [2023-11-23 08:57:43,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:57:43,697 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 36 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:43,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 294 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:57:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-23 08:57:43,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-23 08:57:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 213 states have (on average 1.272300469483568) internal successors, (271), 223 states have internal predecessors, (271), 58 states have call successors, (58), 19 states have call predecessors, (58), 27 states have return successors, (100), 56 states have call predecessors, (100), 54 states have call successors, (100) [2023-11-23 08:57:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 429 transitions. [2023-11-23 08:57:43,728 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 429 transitions. Word has length 79 [2023-11-23 08:57:43,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:43,729 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 429 transitions. [2023-11-23 08:57:43,729 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:57:43,729 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 429 transitions. [2023-11-23 08:57:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 08:57:43,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:43,731 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] [2023-11-23 08:57:43,749 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:57:43,945 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:57:43,946 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:43,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:43,946 INFO L85 PathProgramCache]: Analyzing trace with hash -546148298, now seen corresponding path program 1 times [2023-11-23 08:57:43,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:57:43,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3525934] [2023-11-23 08:57:43,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:43,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:57:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:57:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:57:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:57:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:57:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 08:57:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:57:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:57:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:57:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 08:57:44,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:57:44,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3525934] [2023-11-23 08:57:44,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3525934] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:57:44,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807186740] [2023-11-23 08:57:44,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:44,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:44,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:57:44,122 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:57:44,123 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:57:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:57:44,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-23 08:57:44,288 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:57:44,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807186740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:57:44,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:57:44,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 08:57:44,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620873651] [2023-11-23 08:57:44,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:57:44,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:57:44,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:57:44,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:57:44,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:57:44,291 INFO L87 Difference]: Start difference. First operand 299 states and 429 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:57:44,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:44,343 INFO L93 Difference]: Finished difference Result 426 states and 595 transitions. [2023-11-23 08:57:44,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:57:44,343 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 79 [2023-11-23 08:57:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:44,344 INFO L225 Difference]: With dead ends: 426 [2023-11-23 08:57:44,345 INFO L226 Difference]: Without dead ends: 143 [2023-11-23 08:57:44,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 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:57:44,347 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:44,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 197 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:57:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-23 08:57:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 134. [2023-11-23 08:57:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 101 states have internal predecessors, (119), 24 states have call successors, (24), 10 states have call predecessors, (24), 13 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 08:57:44,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 175 transitions. [2023-11-23 08:57:44,362 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 175 transitions. Word has length 79 [2023-11-23 08:57:44,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:44,363 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 175 transitions. [2023-11-23 08:57:44,363 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:57:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 175 transitions. [2023-11-23 08:57:44,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:57:44,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:44,365 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:57:44,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-23 08:57:44,581 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:57:44,582 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:44,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:44,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1006222226, now seen corresponding path program 1 times [2023-11-23 08:57:44,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:57:44,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541643151] [2023-11-23 08:57:44,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:44,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:57:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:57:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:57:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:57:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:57:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:57:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:57:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:44,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:57:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:45,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:57:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:45,011 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:57:45,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:57:45,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541643151] [2023-11-23 08:57:45,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541643151] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:57:45,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587247223] [2023-11-23 08:57:45,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:45,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:45,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:57:45,014 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:57:45,033 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:57:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:45,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-23 08:57:45,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:45,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 08:57:45,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:57:45,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 08:57:45,342 INFO L349 Elim1Store]: treesize reduction 50, result has 18.0 percent of original size [2023-11-23 08:57:45,343 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 86 treesize of output 98 [2023-11-23 08:57:45,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 55 [2023-11-23 08:57:45,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:57:45,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 30 [2023-11-23 08:57:47,377 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_22| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_34|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_22|))) (and (not (= .cse0 0)) (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_34|)))) is different from true [2023-11-23 08:57:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:57:47,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:57:47,884 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_734 (Array Int Int)) (v_ArrVal_732 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_734))) (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|) (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24) v_ArrVal_732))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))) is different from false [2023-11-23 08:57:47,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:57:47,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2023-11-23 08:57:47,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:57:47,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 273 [2023-11-23 08:57:47,922 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 180 treesize of output 172 [2023-11-23 08:57:48,018 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 24 treesize of output 22 [2023-11-23 08:57:48,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 08:57:48,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:57:48,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 82 [2023-11-23 08:57:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2023-11-23 08:57:48,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587247223] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:57:48,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:57:48,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 11] total 27 [2023-11-23 08:57:48,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897544357] [2023-11-23 08:57:48,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:57:48,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-23 08:57:48,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:57:48,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-23 08:57:48,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=533, Unknown=2, NotChecked=94, Total=702 [2023-11-23 08:57:48,209 INFO L87 Difference]: Start difference. First operand 134 states and 175 transitions. Second operand has 27 states, 25 states have (on average 4.36) internal successors, (109), 27 states have internal predecessors, (109), 9 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) [2023-11-23 08:57:50,426 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:57:52,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:52,250 INFO L93 Difference]: Finished difference Result 448 states and 644 transitions. [2023-11-23 08:57:52,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-23 08:57:52,251 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 4.36) internal successors, (109), 27 states have internal predecessors, (109), 9 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) Word has length 80 [2023-11-23 08:57:52,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:52,253 INFO L225 Difference]: With dead ends: 448 [2023-11-23 08:57:52,253 INFO L226 Difference]: Without dead ends: 298 [2023-11-23 08:57:52,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=489, Invalid=2709, Unknown=2, NotChecked=222, Total=3422 [2023-11-23 08:57:52,255 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 380 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 81 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 2096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 807 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:52,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 878 Invalid, 2096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1207 Invalid, 1 Unknown, 807 Unchecked, 3.0s Time] [2023-11-23 08:57:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-11-23 08:57:52,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 220. [2023-11-23 08:57:52,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 161 states have (on average 1.236024844720497) internal successors, (199), 169 states have internal predecessors, (199), 41 states have call successors, (41), 12 states have call predecessors, (41), 17 states have return successors, (70), 38 states have call predecessors, (70), 39 states have call successors, (70) [2023-11-23 08:57:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 310 transitions. [2023-11-23 08:57:52,288 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 310 transitions. Word has length 80 [2023-11-23 08:57:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:52,289 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 310 transitions. [2023-11-23 08:57:52,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 4.36) internal successors, (109), 27 states have internal predecessors, (109), 9 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) [2023-11-23 08:57:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 310 transitions. [2023-11-23 08:57:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 08:57:52,292 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:52,292 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:57:52,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-23 08:57:52,513 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:57:52,513 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:52,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:52,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1849353911, now seen corresponding path program 1 times [2023-11-23 08:57:52,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:57:52,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586983453] [2023-11-23 08:57:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:52,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:57:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:52,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:57:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:52,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:57:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:52,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:57:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:52,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:57:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:52,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 08:57:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:52,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:57:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:52,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:57:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:52,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 08:57:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:52,829 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-23 08:57:52,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:57:52,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586983453] [2023-11-23 08:57:52,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586983453] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:57:52,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628102986] [2023-11-23 08:57:52,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:52,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:52,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:57:52,831 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:57:52,851 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:57:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:53,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-23 08:57:53,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:53,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:57:53,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:57:53,111 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:57:53,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:57:53,115 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:57:53,119 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 Killed by 15