./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4c102a8320469121bebf24ca3406288a96f198533855b78a0cc2eda1e300f8b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:58:18,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:58:18,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:58:18,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:58:18,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:58:18,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:58:18,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:58:18,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:58:18,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:58:18,426 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:58:18,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:58:18,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:58:18,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:58:18,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:58:18,427 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:58:18,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:58:18,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:58:18,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:58:18,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:58:18,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:58:18,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:58:18,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:58:18,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:58:18,429 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:58:18,429 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:58:18,429 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:58:18,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:58:18,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:58:18,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:58:18,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:58:18,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:58:18,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:58:18,430 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:58:18,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:58:18,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:58:18,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:58:18,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:58:18,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:58:18,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:58:18,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:58:18,430 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 4c102a8320469121bebf24ca3406288a96f198533855b78a0cc2eda1e300f8b5 [2025-03-04 02:58:18,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:58:18,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:58:18,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:58:18,660 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:58:18,660 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:58:18,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2025-03-04 02:58:19,745 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a8e5071/e72c24724fb04c7f89b7e537bd0a19b3/FLAG2c7ff75f1 [2025-03-04 02:58:20,173 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:58:20,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2025-03-04 02:58:20,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a8e5071/e72c24724fb04c7f89b7e537bd0a19b3/FLAG2c7ff75f1 [2025-03-04 02:58:20,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a8e5071/e72c24724fb04c7f89b7e537bd0a19b3 [2025-03-04 02:58:20,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:58:20,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:58:20,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:58:20,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:58:20,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:58:20,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:58:20" (1/1) ... [2025-03-04 02:58:20,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@348da217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:20, skipping insertion in model container [2025-03-04 02:58:20,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:58:20" (1/1) ... [2025-03-04 02:58:20,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:58:20,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2025-03-04 02:58:20,523 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2025-03-04 02:58:20,901 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:20,902 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:20,902 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:20,902 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:20,903 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:20,918 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:20,918 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:20,920 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:20,922 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:20,923 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:20,924 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:20,925 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:20,925 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:21,204 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[150656,150669] [2025-03-04 02:58:21,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:58:21,218 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:58:21,226 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2025-03-04 02:58:21,226 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2025-03-04 02:58:21,254 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:21,255 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:21,255 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:21,255 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:21,256 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:21,263 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:21,263 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:21,264 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:21,264 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:21,265 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:21,265 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:21,265 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:21,266 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:21,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[150656,150669] [2025-03-04 02:58:21,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:58:21,462 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:58:21,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:21 WrapperNode [2025-03-04 02:58:21,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:58:21,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:58:21,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:58:21,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:58:21,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:21" (1/1) ... [2025-03-04 02:58:21,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:21" (1/1) ... [2025-03-04 02:58:21,522 INFO L138 Inliner]: procedures = 668, calls = 1044, calls flagged for inlining = 53, calls inlined = 8, statements flattened = 219 [2025-03-04 02:58:21,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:58:21,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:58:21,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:58:21,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:58:21,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:21" (1/1) ... [2025-03-04 02:58:21,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:21" (1/1) ... [2025-03-04 02:58:21,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:21" (1/1) ... [2025-03-04 02:58:21,563 INFO L175 MemorySlicer]: Split 43 memory accesses to 3 slices as follows [2, 5, 36]. 84 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 9 writes are split as follows [0, 0, 9]. [2025-03-04 02:58:21,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:21" (1/1) ... [2025-03-04 02:58:21,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:21" (1/1) ... [2025-03-04 02:58:21,576 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:21" (1/1) ... [2025-03-04 02:58:21,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:21" (1/1) ... [2025-03-04 02:58:21,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:21" (1/1) ... [2025-03-04 02:58:21,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:21" (1/1) ... [2025-03-04 02:58:21,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:58:21,592 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:58:21,592 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:58:21,592 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:58:21,592 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:21" (1/1) ... [2025-03-04 02:58:21,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:58:21,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:21,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:58:21,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:58:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-03-04 02:58:21,639 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-03-04 02:58:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2025-03-04 02:58:21,639 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2025-03-04 02:58:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:58:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:58:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:58:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:58:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:58:21,639 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:58:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:58:21,639 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:58:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:58:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-04 02:58:21,639 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-04 02:58:21,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:58:21,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:58:21,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:58:21,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:58:21,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:58:21,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:58:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-03-04 02:58:21,641 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-03-04 02:58:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 02:58:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 02:58:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 02:58:21,641 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 02:58:21,641 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 02:58:21,641 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 02:58:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:58:21,641 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:58:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:58:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:58:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:58:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:58:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:58:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:58:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:58:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:58:21,642 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:58:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-03-04 02:58:21,642 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-03-04 02:58:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:58:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:58:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:58:21,801 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:58:21,802 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:58:21,837 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4729: havoc #t~mem317.base, #t~mem317.offset;havoc #t~short318;havoc #t~mem319.base, #t~mem319.offset;havoc #t~mem320.base, #t~mem320.offset;havoc #t~short321; [2025-03-04 02:58:21,872 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:58:21,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-03-04 02:58:22,059 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-04 02:58:22,064 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4685: havoc #t~mem302.base, #t~mem302.offset; [2025-03-04 02:58:22,110 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-03-04 02:58:22,110 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:58:22,121 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:58:22,121 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:58:22,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:58:22 BoogieIcfgContainer [2025-03-04 02:58:22,122 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:58:22,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:58:22,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:58:22,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:58:22,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:58:20" (1/3) ... [2025-03-04 02:58:22,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d019a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:58:22, skipping insertion in model container [2025-03-04 02:58:22,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:21" (2/3) ... [2025-03-04 02:58:22,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d019a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:58:22, skipping insertion in model container [2025-03-04 02:58:22,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:58:22" (3/3) ... [2025-03-04 02:58:22,148 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_back_harness.i [2025-03-04 02:58:22,157 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:58:22,158 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_pop_back_harness.i that has 13 procedures, 142 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-04 02:58:22,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:58:22,206 INFO L333 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, 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;@43edbef7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:58:22,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:58:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 87 states have internal predecessors, (110), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 02:58:22,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 02:58:22,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:22,215 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:22,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:22,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:22,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1741125493, now seen corresponding path program 1 times [2025-03-04 02:58:22,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:22,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772179333] [2025-03-04 02:58:22,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:22,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:22,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 02:58:22,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 02:58:22,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:22,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-03-04 02:58:23,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:23,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772179333] [2025-03-04 02:58:23,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772179333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:23,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907198377] [2025-03-04 02:58:23,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:23,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:23,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:23,240 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) [2025-03-04 02:58:23,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:58:23,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 02:58:23,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 02:58:23,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:23,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:23,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-04 02:58:23,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:23,612 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 16 treesize of output 17 [2025-03-04 02:58:23,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-04 02:58:24,111 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2025-03-04 02:58:24,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 13 [2025-03-04 02:58:24,147 INFO L349 Elim1Store]: treesize reduction 30, result has 43.4 percent of original size [2025-03-04 02:58:24,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 39 [2025-03-04 02:58:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-04 02:58:24,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:24,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 84 treesize of output 80 [2025-03-04 02:58:24,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 78 treesize of output 74 [2025-03-04 02:58:24,696 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-03-04 02:58:24,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907198377] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:58:24,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:58:24,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 12] total 24 [2025-03-04 02:58:24,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590226578] [2025-03-04 02:58:24,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:24,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:58:24,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:24,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:58:24,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:58:24,713 INFO L87 Difference]: Start difference. First operand has 134 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 87 states have internal predecessors, (110), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 24 states, 21 states have (on average 4.0) internal successors, (84), 20 states have internal predecessors, (84), 11 states have call successors, (42), 4 states have call predecessors, (42), 8 states have return successors, (40), 9 states have call predecessors, (40), 11 states have call successors, (40) [2025-03-04 02:58:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:25,702 INFO L93 Difference]: Finished difference Result 276 states and 411 transitions. [2025-03-04 02:58:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:58:25,705 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 4.0) internal successors, (84), 20 states have internal predecessors, (84), 11 states have call successors, (42), 4 states have call predecessors, (42), 8 states have return successors, (40), 9 states have call predecessors, (40), 11 states have call successors, (40) Word has length 118 [2025-03-04 02:58:25,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:25,711 INFO L225 Difference]: With dead ends: 276 [2025-03-04 02:58:25,713 INFO L226 Difference]: Without dead ends: 132 [2025-03-04 02:58:25,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=1328, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 02:58:25,720 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 174 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:25,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 2392 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 02:58:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-04 02:58:25,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-04 02:58:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 85 states have internal predecessors, (104), 37 states have call successors, (37), 10 states have call predecessors, (37), 11 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2025-03-04 02:58:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 181 transitions. [2025-03-04 02:58:25,762 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 181 transitions. Word has length 118 [2025-03-04 02:58:25,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:25,763 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 181 transitions. [2025-03-04 02:58:25,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 4.0) internal successors, (84), 20 states have internal predecessors, (84), 11 states have call successors, (42), 4 states have call predecessors, (42), 8 states have return successors, (40), 9 states have call predecessors, (40), 11 states have call successors, (40) [2025-03-04 02:58:25,763 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 181 transitions. [2025-03-04 02:58:25,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 02:58:25,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:25,767 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:25,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:58:25,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 02:58:25,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:25,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:25,973 INFO L85 PathProgramCache]: Analyzing trace with hash -791596319, now seen corresponding path program 1 times [2025-03-04 02:58:25,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:25,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314708828] [2025-03-04 02:58:25,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:25,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:26,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 02:58:26,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 02:58:26,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:26,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-04 02:58:26,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:26,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314708828] [2025-03-04 02:58:26,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314708828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:26,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678880526] [2025-03-04 02:58:26,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:26,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:26,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:26,249 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) [2025-03-04 02:58:26,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:58:26,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 02:58:26,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 02:58:26,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:26,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:26,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 02:58:26,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:26,531 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-04 02:58:26,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:26,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678880526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:26,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:26,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-03-04 02:58:26,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917006847] [2025-03-04 02:58:26,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:26,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:58:26,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:26,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:58:26,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:58:26,537 INFO L87 Difference]: Start difference. First operand 132 states and 181 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-04 02:58:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:26,787 INFO L93 Difference]: Finished difference Result 250 states and 344 transitions. [2025-03-04 02:58:26,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:58:26,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 120 [2025-03-04 02:58:26,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:26,789 INFO L225 Difference]: With dead ends: 250 [2025-03-04 02:58:26,790 INFO L226 Difference]: Without dead ends: 134 [2025-03-04 02:58:26,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:58:26,791 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 202 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:26,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 880 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:58:26,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-04 02:58:26,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2025-03-04 02:58:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 85 states have internal predecessors, (103), 37 states have call successors, (37), 10 states have call predecessors, (37), 11 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2025-03-04 02:58:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 180 transitions. [2025-03-04 02:58:26,805 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 180 transitions. Word has length 120 [2025-03-04 02:58:26,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:26,805 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 180 transitions. [2025-03-04 02:58:26,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-04 02:58:26,805 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 180 transitions. [2025-03-04 02:58:26,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 02:58:26,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:26,809 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:26,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:58:27,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 02:58:27,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:27,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:27,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1616401305, now seen corresponding path program 1 times [2025-03-04 02:58:27,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:27,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696030173] [2025-03-04 02:58:27,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:27,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:27,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 02:58:27,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 02:58:27,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:27,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-04 02:58:27,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:27,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696030173] [2025-03-04 02:58:27,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696030173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:27,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210305024] [2025-03-04 02:58:27,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:27,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:27,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:27,255 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) [2025-03-04 02:58:27,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:58:27,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 02:58:27,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 02:58:27,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:27,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:27,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:58:27,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-04 02:58:27,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:27,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210305024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:27,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:27,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2025-03-04 02:58:27,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495234817] [2025-03-04 02:58:27,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:27,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:58:27,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:27,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:58:27,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:58:27,529 INFO L87 Difference]: Start difference. First operand 132 states and 180 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-04 02:58:27,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:27,827 INFO L93 Difference]: Finished difference Result 256 states and 352 transitions. [2025-03-04 02:58:27,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:58:27,828 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 122 [2025-03-04 02:58:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:27,830 INFO L225 Difference]: With dead ends: 256 [2025-03-04 02:58:27,830 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 02:58:27,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2025-03-04 02:58:27,831 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 216 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:27,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 990 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:58:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 02:58:27,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2025-03-04 02:58:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 86 states have internal predecessors, (104), 37 states have call successors, (37), 10 states have call predecessors, (37), 11 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2025-03-04 02:58:27,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 181 transitions. [2025-03-04 02:58:27,843 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 181 transitions. Word has length 122 [2025-03-04 02:58:27,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:27,843 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 181 transitions. [2025-03-04 02:58:27,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-04 02:58:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 181 transitions. [2025-03-04 02:58:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 02:58:27,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:27,844 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:27,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:58:28,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:28,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:28,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:28,045 INFO L85 PathProgramCache]: Analyzing trace with hash -615611050, now seen corresponding path program 1 times [2025-03-04 02:58:28,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:28,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430744363] [2025-03-04 02:58:28,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:28,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:28,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 02:58:28,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 02:58:28,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:28,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-04 02:58:28,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:28,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430744363] [2025-03-04 02:58:28,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430744363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:28,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34706261] [2025-03-04 02:58:28,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:28,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:28,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:28,352 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) [2025-03-04 02:58:28,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:58:28,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 02:58:28,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 02:58:28,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:28,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:28,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 02:58:28,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-04 02:58:28,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:28,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34706261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:28,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:28,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-04 02:58:28,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727919790] [2025-03-04 02:58:28,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:28,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:58:28,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:28,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:58:28,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:58:28,519 INFO L87 Difference]: Start difference. First operand 133 states and 181 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 02:58:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:28,538 INFO L93 Difference]: Finished difference Result 251 states and 347 transitions. [2025-03-04 02:58:28,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:58:28,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2025-03-04 02:58:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:28,540 INFO L225 Difference]: With dead ends: 251 [2025-03-04 02:58:28,540 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 02:58:28,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:58:28,542 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 2 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:28,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 337 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:58:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 02:58:28,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2025-03-04 02:58:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 87 states have internal predecessors, (105), 37 states have call successors, (37), 10 states have call predecessors, (37), 11 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2025-03-04 02:58:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 182 transitions. [2025-03-04 02:58:28,555 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 182 transitions. Word has length 123 [2025-03-04 02:58:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:28,555 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 182 transitions. [2025-03-04 02:58:28,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 02:58:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 182 transitions. [2025-03-04 02:58:28,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 02:58:28,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:28,556 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:28,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 02:58:28,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:28,759 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:28,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:28,760 INFO L85 PathProgramCache]: Analyzing trace with hash 139685719, now seen corresponding path program 1 times [2025-03-04 02:58:28,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:28,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658366415] [2025-03-04 02:58:28,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:28,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:28,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 02:58:28,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 02:58:28,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:28,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-04 02:58:29,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:29,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658366415] [2025-03-04 02:58:29,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658366415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:29,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207820664] [2025-03-04 02:58:29,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:29,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:29,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:29,059 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) [2025-03-04 02:58:29,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:58:29,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 02:58:29,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 02:58:29,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:29,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:29,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 02:58:29,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-04 02:58:29,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:29,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207820664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:29,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:29,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 15 [2025-03-04 02:58:29,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374673815] [2025-03-04 02:58:29,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:29,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:58:29,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:29,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:58:29,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:58:29,363 INFO L87 Difference]: Start difference. First operand 134 states and 182 transitions. Second operand has 13 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 6 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 02:58:29,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:29,711 INFO L93 Difference]: Finished difference Result 249 states and 339 transitions. [2025-03-04 02:58:29,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:58:29,711 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 6 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 131 [2025-03-04 02:58:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:29,713 INFO L225 Difference]: With dead ends: 249 [2025-03-04 02:58:29,713 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 02:58:29,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-03-04 02:58:29,714 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 172 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:29,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1417 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:58:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 02:58:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2025-03-04 02:58:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 88 states have internal predecessors, (106), 37 states have call successors, (37), 10 states have call predecessors, (37), 11 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2025-03-04 02:58:29,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 183 transitions. [2025-03-04 02:58:29,730 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 183 transitions. Word has length 131 [2025-03-04 02:58:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:29,730 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 183 transitions. [2025-03-04 02:58:29,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 6 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 02:58:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 183 transitions. [2025-03-04 02:58:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 02:58:29,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:29,731 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:29,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 02:58:29,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:29,932 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:29,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:29,932 INFO L85 PathProgramCache]: Analyzing trace with hash -176238703, now seen corresponding path program 1 times [2025-03-04 02:58:29,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:29,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144579025] [2025-03-04 02:58:29,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:29,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:29,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 02:58:29,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 02:58:29,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:29,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-04 02:58:30,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:30,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144579025] [2025-03-04 02:58:30,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144579025] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:30,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295834596] [2025-03-04 02:58:30,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:30,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:30,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:30,517 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) [2025-03-04 02:58:30,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:58:30,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 02:58:30,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 02:58:30,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:30,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:30,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-04 02:58:30,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:30,727 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 [2025-03-04 02:58:30,733 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 [2025-03-04 02:58:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-04 02:58:31,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-03-04 02:58:31,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295834596] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:58:31,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:58:31,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 12] total 32 [2025-03-04 02:58:31,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373765964] [2025-03-04 02:58:31,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:31,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 02:58:31,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:31,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 02:58:31,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2025-03-04 02:58:31,859 INFO L87 Difference]: Start difference. First operand 135 states and 183 transitions. Second operand has 32 states, 30 states have (on average 4.066666666666666) internal successors, (122), 31 states have internal predecessors, (122), 13 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (37), 11 states have call predecessors, (37), 13 states have call successors, (37) [2025-03-04 02:58:35,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:35,118 INFO L93 Difference]: Finished difference Result 482 states and 703 transitions. [2025-03-04 02:58:35,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-04 02:58:35,119 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 4.066666666666666) internal successors, (122), 31 states have internal predecessors, (122), 13 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (37), 11 states have call predecessors, (37), 13 states have call successors, (37) Word has length 133 [2025-03-04 02:58:35,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:35,123 INFO L225 Difference]: With dead ends: 482 [2025-03-04 02:58:35,123 INFO L226 Difference]: Without dead ends: 366 [2025-03-04 02:58:35,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 255 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=566, Invalid=4690, Unknown=0, NotChecked=0, Total=5256 [2025-03-04 02:58:35,126 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 394 mSDsluCounter, 3979 mSDsCounter, 0 mSdLazyCounter, 4113 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 4229 SdHoareTripleChecker+Invalid, 4391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 4113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:35,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 4229 Invalid, 4391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 4113 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-04 02:58:35,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-04 02:58:35,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 305. [2025-03-04 02:58:35,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 210 states have (on average 1.2666666666666666) internal successors, (266), 215 states have internal predecessors, (266), 71 states have call successors, (71), 20 states have call predecessors, (71), 23 states have return successors, (87), 69 states have call predecessors, (87), 69 states have call successors, (87) [2025-03-04 02:58:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 424 transitions. [2025-03-04 02:58:35,150 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 424 transitions. Word has length 133 [2025-03-04 02:58:35,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:35,150 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 424 transitions. [2025-03-04 02:58:35,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 4.066666666666666) internal successors, (122), 31 states have internal predecessors, (122), 13 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (37), 11 states have call predecessors, (37), 13 states have call successors, (37) [2025-03-04 02:58:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 424 transitions. [2025-03-04 02:58:35,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 02:58:35,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:35,152 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:35,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 02:58:35,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:35,356 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:35,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:35,356 INFO L85 PathProgramCache]: Analyzing trace with hash -352876450, now seen corresponding path program 1 times [2025-03-04 02:58:35,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:35,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861699788] [2025-03-04 02:58:35,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:35,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 02:58:35,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 02:58:35,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:35,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-04 02:58:36,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:36,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861699788] [2025-03-04 02:58:36,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861699788] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:36,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327546995] [2025-03-04 02:58:36,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:36,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:36,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:36,167 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) [2025-03-04 02:58:36,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:58:36,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 02:58:36,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 02:58:36,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:36,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:36,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-03-04 02:58:36,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:36,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 02:58:36,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-04 02:58:36,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:36,595 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 16 treesize of output 11 [2025-03-04 02:58:36,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:36,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 02:58:36,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:36,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:36,625 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 22 treesize of output 22 [2025-03-04 02:58:36,630 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 [2025-03-04 02:58:36,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:36,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:36,634 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 30 treesize of output 27 [2025-03-04 02:58:36,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 [2025-03-04 02:58:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 115 proven. 23 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 02:58:37,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:41,134 INFO L349 Elim1Store]: treesize reduction 58, result has 65.1 percent of original size [2025-03-04 02:58:41,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 2230 treesize of output 2160 [2025-03-04 02:58:41,202 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:41,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 2369 treesize of output 1919 [2025-03-04 02:58:44,332 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 02:58:44,351 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 14 treesize of output 3 [2025-03-04 02:58:44,599 INFO L349 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2025-03-04 02:58:44,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 82 [2025-03-04 02:58:44,630 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 84 treesize of output 60 [2025-03-04 02:58:44,649 INFO L349 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2025-03-04 02:58:44,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 82 [2025-03-04 02:58:44,678 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:44,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 48 treesize of output 46 [2025-03-04 02:58:44,706 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:44,707 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 02:58:44,725 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:44,726 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-04 02:58:44,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 26 treesize of output 24 [2025-03-04 02:58:44,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2025-03-04 02:58:44,742 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:58:44,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 65 treesize of output 50 [2025-03-04 02:58:44,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:44,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 157 [2025-03-04 02:58:44,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:44,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 237 [2025-03-04 02:58:44,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 175 treesize of output 171 [2025-03-04 02:58:44,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 171 treesize of output 169 [2025-03-04 02:58:44,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 169 treesize of output 167 [2025-03-04 02:58:44,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 167 treesize of output 165 [2025-03-04 02:58:44,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 165 treesize of output 163 [2025-03-04 02:58:44,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 163 treesize of output 161 [2025-03-04 02:58:45,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327546995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:45,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:58:45,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2025-03-04 02:58:45,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992367255] [2025-03-04 02:58:45,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:45,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 02:58:45,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:45,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 02:58:45,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2785, Unknown=1, NotChecked=0, Total=2970 [2025-03-04 02:58:45,591 INFO L87 Difference]: Start difference. First operand 305 states and 424 transitions. Second operand has 34 states, 31 states have (on average 4.451612903225806) internal successors, (138), 32 states have internal predecessors, (138), 15 states have call successors, (33), 4 states have call predecessors, (33), 9 states have return successors, (32), 13 states have call predecessors, (32), 15 states have call successors, (32) [2025-03-04 02:58:48,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:48,393 INFO L93 Difference]: Finished difference Result 782 states and 1059 transitions. [2025-03-04 02:58:48,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 02:58:48,394 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 4.451612903225806) internal successors, (138), 32 states have internal predecessors, (138), 15 states have call successors, (33), 4 states have call predecessors, (33), 9 states have return successors, (32), 13 states have call predecessors, (32), 15 states have call successors, (32) Word has length 134 [2025-03-04 02:58:48,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:48,397 INFO L225 Difference]: With dead ends: 782 [2025-03-04 02:58:48,397 INFO L226 Difference]: Without dead ends: 498 [2025-03-04 02:58:48,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 211 SyntacticMatches, 15 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=468, Invalid=6503, Unknown=1, NotChecked=0, Total=6972 [2025-03-04 02:58:48,403 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 486 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 2044 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 2307 SdHoareTripleChecker+Invalid, 2309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:48,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 2307 Invalid, 2309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2044 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 02:58:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-04 02:58:48,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 413. [2025-03-04 02:58:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 305 states have (on average 1.298360655737705) internal successors, (396), 310 states have internal predecessors, (396), 77 states have call successors, (77), 27 states have call predecessors, (77), 30 states have return successors, (85), 75 states have call predecessors, (85), 75 states have call successors, (85) [2025-03-04 02:58:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 558 transitions. [2025-03-04 02:58:48,445 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 558 transitions. Word has length 134 [2025-03-04 02:58:48,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:48,446 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 558 transitions. [2025-03-04 02:58:48,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 4.451612903225806) internal successors, (138), 32 states have internal predecessors, (138), 15 states have call successors, (33), 4 states have call predecessors, (33), 9 states have return successors, (32), 13 states have call predecessors, (32), 15 states have call successors, (32) [2025-03-04 02:58:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 558 transitions. [2025-03-04 02:58:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 02:58:48,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:48,448 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:48,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 02:58:48,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:48,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:48,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:48,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1488559026, now seen corresponding path program 1 times [2025-03-04 02:58:48,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:48,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735723280] [2025-03-04 02:58:48,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:48,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:48,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 02:58:48,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 02:58:48,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:48,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 02:58:48,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:48,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735723280] [2025-03-04 02:58:48,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735723280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:48,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935545994] [2025-03-04 02:58:48,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:48,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:48,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:48,735 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) [2025-03-04 02:58:48,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:58:48,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 02:58:48,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 02:58:48,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:48,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:48,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:58:48,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-04 02:58:48,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:48,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935545994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:48,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:48,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-04 02:58:48,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442444413] [2025-03-04 02:58:48,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:48,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:58:48,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:48,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:58:48,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:58:48,916 INFO L87 Difference]: Start difference. First operand 413 states and 558 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 02:58:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:48,952 INFO L93 Difference]: Finished difference Result 815 states and 1117 transitions. [2025-03-04 02:58:48,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:58:48,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2025-03-04 02:58:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:48,956 INFO L225 Difference]: With dead ends: 815 [2025-03-04 02:58:48,956 INFO L226 Difference]: Without dead ends: 421 [2025-03-04 02:58:48,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:58:48,958 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:48,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 510 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:58:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-04 02:58:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 417. [2025-03-04 02:58:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 309 states have (on average 1.2750809061488673) internal successors, (394), 314 states have internal predecessors, (394), 77 states have call successors, (77), 27 states have call predecessors, (77), 30 states have return successors, (85), 75 states have call predecessors, (85), 75 states have call successors, (85) [2025-03-04 02:58:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 556 transitions. [2025-03-04 02:58:48,990 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 556 transitions. Word has length 133 [2025-03-04 02:58:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:48,990 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 556 transitions. [2025-03-04 02:58:48,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 02:58:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 556 transitions. [2025-03-04 02:58:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 02:58:48,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:48,991 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:48,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 02:58:49,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 02:58:49,192 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:49,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:49,192 INFO L85 PathProgramCache]: Analyzing trace with hash -87360493, now seen corresponding path program 1 times [2025-03-04 02:58:49,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:49,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673630223] [2025-03-04 02:58:49,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:49,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:49,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 02:58:49,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 02:58:49,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:49,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-04 02:58:49,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:49,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673630223] [2025-03-04 02:58:49,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673630223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:49,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596669674] [2025-03-04 02:58:49,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:49,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:49,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:49,279 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) [2025-03-04 02:58:49,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:58:49,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 02:58:49,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 02:58:49,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:49,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:49,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:58:49,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-04 02:58:49,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:49,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596669674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:49,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:49,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-04 02:58:49,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293132922] [2025-03-04 02:58:49,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:49,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:58:49,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:49,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:58:49,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:58:49,460 INFO L87 Difference]: Start difference. First operand 417 states and 556 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 02:58:49,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:49,484 INFO L93 Difference]: Finished difference Result 604 states and 816 transitions. [2025-03-04 02:58:49,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:58:49,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2025-03-04 02:58:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:49,486 INFO L225 Difference]: With dead ends: 604 [2025-03-04 02:58:49,486 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 02:58:49,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:58:49,487 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:49,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:58:49,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 02:58:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2025-03-04 02:58:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 144 states have (on average 1.2430555555555556) internal successors, (179), 146 states have internal predecessors, (179), 42 states have call successors, (42), 15 states have call predecessors, (42), 16 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2025-03-04 02:58:49,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 265 transitions. [2025-03-04 02:58:49,505 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 265 transitions. Word has length 133 [2025-03-04 02:58:49,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:49,505 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 265 transitions. [2025-03-04 02:58:49,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 02:58:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 265 transitions. [2025-03-04 02:58:49,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 02:58:49,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:49,509 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:49,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 02:58:49,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:49,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:49,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:49,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1692030823, now seen corresponding path program 2 times [2025-03-04 02:58:49,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:49,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925000452] [2025-03-04 02:58:49,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:58:49,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:49,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-04 02:58:49,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 02:58:49,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:58:49,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-04 02:58:50,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:50,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925000452] [2025-03-04 02:58:50,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925000452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:50,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454383341] [2025-03-04 02:58:50,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:58:50,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:50,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:50,018 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) [2025-03-04 02:58:50,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:58:50,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-04 02:58:50,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 02:58:50,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:58:50,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:50,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-03-04 02:58:50,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:50,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 02:58:50,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-04 02:58:50,371 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 02:58:50,371 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-04 02:58:50,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-04 02:58:50,384 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 02:58:50,385 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-04 02:58:50,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 02:58:50,397 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 02:58:50,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 02:58:50,432 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-04 02:58:50,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 46 [2025-03-04 02:58:50,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:50,437 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 26 treesize of output 23 [2025-03-04 02:58:50,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 18 [2025-03-04 02:58:51,917 INFO L349 Elim1Store]: treesize reduction 88, result has 1.1 percent of original size [2025-03-04 02:58:51,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 19 case distinctions, treesize of input 72 treesize of output 1 [2025-03-04 02:58:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 115 proven. 30 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-04 02:58:51,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:52,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:52,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 100 [2025-03-04 02:58:52,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:52,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 116 [2025-03-04 02:58:52,446 INFO L349 Elim1Store]: treesize reduction 45, result has 77.4 percent of original size [2025-03-04 02:58:52,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 2975 treesize of output 2574 [2025-03-04 02:58:52,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:52,564 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 9917 treesize of output 9603 [2025-03-04 02:58:52,677 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 2737 treesize of output 2697 [2025-03-04 02:58:52,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:52,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5418 treesize of output 5291 [2025-03-04 02:58:53,004 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 [2025-03-04 02:58:54,787 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 3018 treesize of output 3006 [2025-03-04 02:59:25,531 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 392 treesize of output 384 [2025-03-04 02:59:29,625 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 372 treesize of output 364 [2025-03-04 02:59:35,503 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-04 02:59:35,503 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 355 treesize of output 1 [2025-03-04 02:59:36,595 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 211 treesize of output 203 [2025-03-04 02:59:48,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:59:48,607 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 6553 treesize of output 6551