./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2b70e84b228eaa9531633412d2ab011238b584270b603d32c94fa23bf8e03be1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 17:20:25,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 17:20:25,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 17:20:25,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 17:20:25,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 17:20:25,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 17:20:25,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 17:20:25,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 17:20:25,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 17:20:25,099 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 17:20:25,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 17:20:25,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 17:20:25,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 17:20:25,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 17:20:25,101 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 17:20:25,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 17:20:25,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 17:20:25,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 17:20:25,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 17:20:25,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 17:20:25,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 17:20:25,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 17:20:25,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 17:20:25,102 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 17:20:25,102 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 17:20:25,102 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 17:20:25,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:20:25,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:20:25,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:20:25,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:20:25,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 17:20:25,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:20:25,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:20:25,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:20:25,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:20:25,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 17:20:25,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 17:20:25,103 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 17:20:25,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 17:20:25,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 17:20:25,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 17:20:25,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 17:20:25,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 17:20:25,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 17:20:25,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 17:20:25,104 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-jdk21/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 -> 2b70e84b228eaa9531633412d2ab011238b584270b603d32c94fa23bf8e03be1 [2025-01-09 17:20:25,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 17:20:25,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 17:20:25,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 17:20:25,310 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 17:20:25,310 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 17:20:25,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i [2025-01-09 17:20:26,453 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d52e0e30f/1724582e3b474866acefb8d993ba6f8b/FLAGbee962596 [2025-01-09 17:20:26,909 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 17:20:26,910 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i [2025-01-09 17:20:26,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d52e0e30f/1724582e3b474866acefb8d993ba6f8b/FLAGbee962596 [2025-01-09 17:20:26,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d52e0e30f/1724582e3b474866acefb8d993ba6f8b [2025-01-09 17:20:26,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 17:20:26,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 17:20:26,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 17:20:26,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 17:20:26,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 17:20:26,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:20:26" (1/1) ... [2025-01-09 17:20:26,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70cfbe51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:26, skipping insertion in model container [2025-01-09 17:20:26,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:20:26" (1/1) ... [2025-01-09 17:20:27,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 17:20:27,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[4493,4506] [2025-01-09 17:20:27,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[4553,4566] [2025-01-09 17:20:27,703 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:27,703 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:27,703 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:27,704 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:27,704 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:27,716 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:27,718 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:27,719 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:27,719 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:27,720 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:27,721 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:27,721 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:27,721 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:28,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[150460,150473] [2025-01-09 17:20:28,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:20:28,061 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 17:20:28,071 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[4493,4506] [2025-01-09 17:20:28,071 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[4553,4566] [2025-01-09 17:20:28,113 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:28,114 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:28,114 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:28,114 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:28,115 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:28,122 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:28,123 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:28,124 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:28,124 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:28,125 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:28,126 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:28,126 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:28,126 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:28,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[150460,150473] [2025-01-09 17:20:28,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:20:28,333 INFO L204 MainTranslator]: Completed translation [2025-01-09 17:20:28,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:28 WrapperNode [2025-01-09 17:20:28,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 17:20:28,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 17:20:28,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 17:20:28,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 17:20:28,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:28" (1/1) ... [2025-01-09 17:20:28,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:28" (1/1) ... [2025-01-09 17:20:28,435 INFO L138 Inliner]: procedures = 668, calls = 1038, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 131 [2025-01-09 17:20:28,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 17:20:28,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 17:20:28,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 17:20:28,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 17:20:28,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:28" (1/1) ... [2025-01-09 17:20:28,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:28" (1/1) ... [2025-01-09 17:20:28,448 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:28" (1/1) ... [2025-01-09 17:20:28,466 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 5, 14]. 67 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-01-09 17:20:28,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:28" (1/1) ... [2025-01-09 17:20:28,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:28" (1/1) ... [2025-01-09 17:20:28,478 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:28" (1/1) ... [2025-01-09 17:20:28,479 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:28" (1/1) ... [2025-01-09 17:20:28,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:28" (1/1) ... [2025-01-09 17:20:28,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:28" (1/1) ... [2025-01-09 17:20:28,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:28" (1/1) ... [2025-01-09 17:20:28,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 17:20:28,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 17:20:28,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 17:20:28,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 17:20:28,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:28" (1/1) ... [2025-01-09 17:20:28,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:20:28,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:28,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 17:20:28,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 17:20:28,535 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:20:28,535 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-01-09 17:20:28,535 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 17:20:28,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 17:20:28,535 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 17:20:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-01-09 17:20:28,536 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-01-09 17:20:28,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 17:20:28,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 17:20:28,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 17:20:28,703 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 17:20:28,704 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 17:20:28,881 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-01-09 17:20:28,882 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 17:20:28,890 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 17:20:28,890 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 17:20:28,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:20:28 BoogieIcfgContainer [2025-01-09 17:20:28,891 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 17:20:28,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 17:20:28,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 17:20:28,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 17:20:28,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:20:26" (1/3) ... [2025-01-09 17:20:28,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273509c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:20:28, skipping insertion in model container [2025-01-09 17:20:28,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:28" (2/3) ... [2025-01-09 17:20:28,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273509c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:20:28, skipping insertion in model container [2025-01-09 17:20:28,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:20:28" (3/3) ... [2025-01-09 17:20:28,897 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_end_harness.i [2025-01-09 17:20:28,906 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 17:20:28,907 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_end_harness.i that has 6 procedures, 66 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 17:20:28,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 17:20:28,951 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;@40b61bf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 17:20:28,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 17:20:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 17:20:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 17:20:28,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:28,959 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:28,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:28,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:28,963 INFO L85 PathProgramCache]: Analyzing trace with hash -437087491, now seen corresponding path program 1 times [2025-01-09 17:20:28,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:28,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309050335] [2025-01-09 17:20:28,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:28,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:29,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:29,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:29,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:29,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 17:20:29,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:29,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309050335] [2025-01-09 17:20:29,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309050335] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:29,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271469854] [2025-01-09 17:20:29,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:29,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:29,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:29,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:20:29,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 17:20:29,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:29,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:29,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:29,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:29,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 17:20:29,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 17:20:29,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:29,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271469854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:29,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:29,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 17:20:29,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369009220] [2025-01-09 17:20:29,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:29,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 17:20:29,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:29,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 17:20:29,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 17:20:29,486 INFO L87 Difference]: Start difference. First operand has 66 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 17:20:29,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:29,507 INFO L93 Difference]: Finished difference Result 124 states and 172 transitions. [2025-01-09 17:20:29,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 17:20:29,509 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-01-09 17:20:29,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:29,513 INFO L225 Difference]: With dead ends: 124 [2025-01-09 17:20:29,513 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 17:20:29,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 17:20:29,517 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:29,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:20:29,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 17:20:29,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-09 17:20:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 17:20:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2025-01-09 17:20:29,544 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 67 [2025-01-09 17:20:29,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:29,544 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2025-01-09 17:20:29,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 17:20:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2025-01-09 17:20:29,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 17:20:29,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:29,546 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:29,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 17:20:29,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 17:20:29,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:29,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:29,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1850366153, now seen corresponding path program 1 times [2025-01-09 17:20:29,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:29,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289433686] [2025-01-09 17:20:29,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:29,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:29,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:29,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:29,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:29,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 17:20:30,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:30,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289433686] [2025-01-09 17:20:30,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289433686] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:30,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191015978] [2025-01-09 17:20:30,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:30,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:30,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:30,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:20:30,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 17:20:30,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:30,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:30,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:30,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:30,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 17:20:30,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:30,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-01-09 17:20:30,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-01-09 17:20:30,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:30,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:30,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:30,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2025-01-09 17:20:30,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:30,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:30,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2025-01-09 17:20:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 17:20:31,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:31,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191015978] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:31,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:31,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2025-01-09 17:20:31,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217065074] [2025-01-09 17:20:31,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:31,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:20:31,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:31,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:20:31,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 17:20:31,299 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 17:20:31,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:31,770 INFO L93 Difference]: Finished difference Result 167 states and 227 transitions. [2025-01-09 17:20:31,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:20:31,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2025-01-09 17:20:31,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:31,773 INFO L225 Difference]: With dead ends: 167 [2025-01-09 17:20:31,773 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 17:20:31,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:20:31,774 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 47 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:31,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 432 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 17:20:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 17:20:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2025-01-09 17:20:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 82 states have internal predecessors, (106), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-01-09 17:20:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 154 transitions. [2025-01-09 17:20:31,795 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 154 transitions. Word has length 67 [2025-01-09 17:20:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:31,795 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 154 transitions. [2025-01-09 17:20:31,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 17:20:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 154 transitions. [2025-01-09 17:20:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 17:20:31,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:31,797 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:31,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 17:20:32,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:32,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:32,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:32,004 INFO L85 PathProgramCache]: Analyzing trace with hash 395213301, now seen corresponding path program 1 times [2025-01-09 17:20:32,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:32,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427405329] [2025-01-09 17:20:32,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:32,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:32,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:32,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:32,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:32,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 17:20:32,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:32,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427405329] [2025-01-09 17:20:32,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427405329] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:32,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300230271] [2025-01-09 17:20:32,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:32,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:32,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:32,281 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:20:32,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 17:20:32,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:32,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:32,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:32,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:32,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 17:20:32,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:32,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-01-09 17:20:32,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-01-09 17:20:32,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:32,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:32,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2025-01-09 17:20:32,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:32,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:32,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:32,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2025-01-09 17:20:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 17:20:33,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:33,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300230271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:33,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:33,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-01-09 17:20:33,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624445902] [2025-01-09 17:20:33,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:33,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:20:33,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:33,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:20:33,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 17:20:33,259 INFO L87 Difference]: Start difference. First operand 114 states and 154 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 17:20:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:33,723 INFO L93 Difference]: Finished difference Result 167 states and 224 transitions. [2025-01-09 17:20:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 17:20:33,723 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 67 [2025-01-09 17:20:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:33,724 INFO L225 Difference]: With dead ends: 167 [2025-01-09 17:20:33,724 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 17:20:33,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-01-09 17:20:33,725 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 49 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:33,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 400 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 17:20:33,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 17:20:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2025-01-09 17:20:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 80 states have internal predecessors, (104), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 17:20:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 150 transitions. [2025-01-09 17:20:33,736 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 150 transitions. Word has length 67 [2025-01-09 17:20:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:33,736 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 150 transitions. [2025-01-09 17:20:33,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 17:20:33,736 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 150 transitions. [2025-01-09 17:20:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 17:20:33,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:33,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:33,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 17:20:33,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:33,941 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:33,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:33,942 INFO L85 PathProgramCache]: Analyzing trace with hash -352093711, now seen corresponding path program 1 times [2025-01-09 17:20:33,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:33,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71125551] [2025-01-09 17:20:33,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:33,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:33,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:33,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:33,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:33,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 17:20:34,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:34,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71125551] [2025-01-09 17:20:34,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71125551] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:34,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250517122] [2025-01-09 17:20:34,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:34,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:34,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:34,193 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:20:34,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 17:20:34,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:34,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:34,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:34,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:34,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 17:20:34,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:34,406 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2025-01-09 17:20:34,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2025-01-09 17:20:34,418 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 11 [2025-01-09 17:20:34,434 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 17:20:34,435 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-01-09 17:20:34,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 20 [2025-01-09 17:20:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 17:20:35,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:35,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250517122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:35,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:35,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2025-01-09 17:20:35,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850357296] [2025-01-09 17:20:35,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:35,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 17:20:35,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:35,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 17:20:35,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-01-09 17:20:35,824 INFO L87 Difference]: Start difference. First operand 112 states and 150 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 17:20:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:36,772 INFO L93 Difference]: Finished difference Result 180 states and 249 transitions. [2025-01-09 17:20:36,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 17:20:36,773 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2025-01-09 17:20:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:36,774 INFO L225 Difference]: With dead ends: 180 [2025-01-09 17:20:36,774 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 17:20:36,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-01-09 17:20:36,775 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 202 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 59 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:36,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 462 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 280 Invalid, 5 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 17:20:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 17:20:36,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2025-01-09 17:20:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.325) internal successors, (106), 82 states have internal predecessors, (106), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 17:20:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 152 transitions. [2025-01-09 17:20:36,787 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 152 transitions. Word has length 67 [2025-01-09 17:20:36,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:36,787 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 152 transitions. [2025-01-09 17:20:36,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 17:20:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 152 transitions. [2025-01-09 17:20:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 17:20:36,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:36,789 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:36,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 17:20:36,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:36,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:36,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:36,990 INFO L85 PathProgramCache]: Analyzing trace with hash 673678891, now seen corresponding path program 1 times [2025-01-09 17:20:36,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:36,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737338440] [2025-01-09 17:20:36,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:36,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:37,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:37,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:37,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:37,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 17:20:37,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:37,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737338440] [2025-01-09 17:20:37,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737338440] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:37,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703461041] [2025-01-09 17:20:37,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:37,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:37,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:37,215 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:20:37,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 17:20:37,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:37,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:37,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:37,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:37,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 17:20:37,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:37,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-01-09 17:20:37,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-01-09 17:20:37,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:37,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:37,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2025-01-09 17:20:37,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:37,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:37,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:37,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2025-01-09 17:20:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 17:20:38,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:38,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703461041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:38,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:38,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-01-09 17:20:38,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382372726] [2025-01-09 17:20:38,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:38,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 17:20:38,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:38,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 17:20:38,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:20:38,335 INFO L87 Difference]: Start difference. First operand 114 states and 152 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 17:20:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:38,939 INFO L93 Difference]: Finished difference Result 187 states and 257 transitions. [2025-01-09 17:20:38,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 17:20:38,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2025-01-09 17:20:38,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:38,941 INFO L225 Difference]: With dead ends: 187 [2025-01-09 17:20:38,941 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 17:20:38,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-01-09 17:20:38,942 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 73 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:38,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 513 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 17:20:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 17:20:38,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2025-01-09 17:20:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 84 states have internal predecessors, (108), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 17:20:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2025-01-09 17:20:38,966 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 67 [2025-01-09 17:20:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:38,966 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2025-01-09 17:20:38,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 17:20:38,967 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2025-01-09 17:20:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 17:20:38,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:38,970 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:38,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 17:20:39,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:39,170 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:39,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:39,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1401328667, now seen corresponding path program 1 times [2025-01-09 17:20:39,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:39,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098473725] [2025-01-09 17:20:39,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:39,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:39,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:39,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:39,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 17:20:39,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:39,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098473725] [2025-01-09 17:20:39,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098473725] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:39,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479282443] [2025-01-09 17:20:39,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:39,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:39,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:39,502 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:20:39,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 17:20:39,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:39,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:39,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:39,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:39,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 17:20:39,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:39,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-01-09 17:20:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 17:20:40,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:40,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479282443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:40,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:40,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2025-01-09 17:20:40,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882859651] [2025-01-09 17:20:40,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:40,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 17:20:40,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:40,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 17:20:40,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-01-09 17:20:40,339 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 17:20:44,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:20:48,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:20:52,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:20:56,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:21:00,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:21:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:00,861 INFO L93 Difference]: Finished difference Result 195 states and 266 transitions. [2025-01-09 17:21:00,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 17:21:00,861 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2025-01-09 17:21:00,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:00,862 INFO L225 Difference]: With dead ends: 195 [2025-01-09 17:21:00,862 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 17:21:00,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2025-01-09 17:21:00,863 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 225 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 58 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:00,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 422 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 262 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2025-01-09 17:21:00,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 17:21:00,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2025-01-09 17:21:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 86 states have internal predecessors, (110), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 17:21:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2025-01-09 17:21:00,884 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 156 transitions. Word has length 67 [2025-01-09 17:21:00,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:00,884 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 156 transitions. [2025-01-09 17:21:00,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 17:21:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2025-01-09 17:21:00,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 17:21:00,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:00,886 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:21:00,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 17:21:01,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 17:21:01,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:01,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:01,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1676200735, now seen corresponding path program 1 times [2025-01-09 17:21:01,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:01,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526359392] [2025-01-09 17:21:01,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:01,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:01,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:21:01,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:21:01,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:01,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 17:21:01,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:01,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526359392] [2025-01-09 17:21:01,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526359392] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:01,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229564994] [2025-01-09 17:21:01,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:01,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:01,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:01,175 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:21:01,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 17:21:01,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:21:01,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:21:01,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:01,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:01,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 17:21:01,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 17:21:01,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:21:01,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229564994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:21:01,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:21:01,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-01-09 17:21:01,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724656647] [2025-01-09 17:21:01,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:21:01,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 17:21:01,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:01,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 17:21:01,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:21:01,336 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 17:21:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:01,442 INFO L93 Difference]: Finished difference Result 251 states and 342 transitions. [2025-01-09 17:21:01,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 17:21:01,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-01-09 17:21:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:01,443 INFO L225 Difference]: With dead ends: 251 [2025-01-09 17:21:01,443 INFO L226 Difference]: Without dead ends: 148 [2025-01-09 17:21:01,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 17:21:01,444 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 95 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:01,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 267 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:21:01,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-09 17:21:01,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-01-09 17:21:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 110 states have (on average 1.3454545454545455) internal successors, (148), 114 states have internal predecessors, (148), 26 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2025-01-09 17:21:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 202 transitions. [2025-01-09 17:21:01,467 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 202 transitions. Word has length 67 [2025-01-09 17:21:01,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:01,468 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 202 transitions. [2025-01-09 17:21:01,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 17:21:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 202 transitions. [2025-01-09 17:21:01,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 17:21:01,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:01,469 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:21:01,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 17:21:01,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:01,670 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:01,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:01,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1917384795, now seen corresponding path program 1 times [2025-01-09 17:21:01,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:01,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002217163] [2025-01-09 17:21:01,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:01,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:01,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 17:21:01,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 17:21:01,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:01,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 17:21:01,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:01,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002217163] [2025-01-09 17:21:01,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002217163] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:01,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976768639] [2025-01-09 17:21:01,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:01,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:01,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:01,855 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:21:01,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 17:21:01,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 17:21:01,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 17:21:01,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:01,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:01,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-09 17:21:02,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:02,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-01-09 17:21:02,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-01-09 17:21:02,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:02,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:02,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-01-09 17:21:02,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:02,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-01-09 17:21:02,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:02,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-01-09 17:21:02,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:02,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-09 17:21:02,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:02,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:02,144 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 38 treesize of output 35 [2025-01-09 17:21:02,147 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 24 treesize of output 13 [2025-01-09 17:21:02,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:02,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:02,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2025-01-09 17:21:02,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2025-01-09 17:21:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 17:21:02,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:21:02,957 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 16))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| 1)) (forall ((v_ArrVal_584 Int) (v_ArrVal_591 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_584)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| v_ArrVal_591))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| 1)) (forall ((v_ArrVal_587 Int) (v_ArrVal_593 (Array Int Int)) (v_subst_1 Int)) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_587)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| v_ArrVal_593))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_1))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2025-01-09 17:21:02,968 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 17:21:02,969 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 17:21:03,022 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-01-09 17:21:03,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 171 treesize of output 200 [2025-01-09 17:21:03,031 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 17:21:03,032 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 17:21:03,088 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-01-09 17:21:03,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 327 treesize of output 314 [2025-01-09 17:21:03,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:03,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 258 [2025-01-09 17:21:03,113 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 217 treesize of output 205 [2025-01-09 17:21:03,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:03,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 296 [2025-01-09 17:21:03,138 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 263 treesize of output 251 [2025-01-09 17:21:03,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 17:21:03,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:03,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 105 [2025-01-09 17:21:03,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:03,705 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 32 treesize of output 32 [2025-01-09 17:21:03,748 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2025-01-09 17:21:03,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976768639] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:21:03,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:21:03,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 23 [2025-01-09 17:21:03,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343481463] [2025-01-09 17:21:03,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:21:03,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 17:21:03,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:03,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 17:21:03,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=392, Unknown=11, NotChecked=40, Total=506 [2025-01-09 17:21:03,750 INFO L87 Difference]: Start difference. First operand 148 states and 202 transitions. Second operand has 23 states, 20 states have (on average 4.6) internal successors, (92), 22 states have internal predecessors, (92), 9 states have call successors, (21), 3 states have call predecessors, (21), 7 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) [2025-01-09 17:21:04,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:04,564 INFO L93 Difference]: Finished difference Result 293 states and 404 transitions. [2025-01-09 17:21:04,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 17:21:04,564 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 4.6) internal successors, (92), 22 states have internal predecessors, (92), 9 states have call successors, (21), 3 states have call predecessors, (21), 7 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) Word has length 68 [2025-01-09 17:21:04,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:04,566 INFO L225 Difference]: With dead ends: 293 [2025-01-09 17:21:04,566 INFO L226 Difference]: Without dead ends: 162 [2025-01-09 17:21:04,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 117 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=969, Unknown=13, NotChecked=64, Total=1190 [2025-01-09 17:21:04,567 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 67 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:04,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1143 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 644 Invalid, 0 Unknown, 136 Unchecked, 0.5s Time] [2025-01-09 17:21:04,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-01-09 17:21:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2025-01-09 17:21:04,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 118 states have (on average 1.3220338983050848) internal successors, (156), 125 states have internal predecessors, (156), 26 states have call successors, (26), 10 states have call predecessors, (26), 15 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) [2025-01-09 17:21:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 215 transitions. [2025-01-09 17:21:04,588 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 215 transitions. Word has length 68 [2025-01-09 17:21:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:04,590 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 215 transitions. [2025-01-09 17:21:04,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 4.6) internal successors, (92), 22 states have internal predecessors, (92), 9 states have call successors, (21), 3 states have call predecessors, (21), 7 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) [2025-01-09 17:21:04,590 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 215 transitions. [2025-01-09 17:21:04,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 17:21:04,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:04,591 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:21:04,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 17:21:04,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:04,791 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:04,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:04,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1390095955, now seen corresponding path program 1 times [2025-01-09 17:21:04,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:04,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949388848] [2025-01-09 17:21:04,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:04,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:04,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 17:21:04,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 17:21:04,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:04,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 17:21:04,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:04,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949388848] [2025-01-09 17:21:04,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949388848] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:04,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736655191] [2025-01-09 17:21:04,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:04,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:04,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:04,925 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:21:04,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 17:21:05,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 17:21:05,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 17:21:05,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:05,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:05,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 17:21:05,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 17:21:05,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:21:05,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736655191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:21:05,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:21:05,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-01-09 17:21:05,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858476913] [2025-01-09 17:21:05,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:21:05,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 17:21:05,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:05,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 17:21:05,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 17:21:05,161 INFO L87 Difference]: Start difference. First operand 160 states and 215 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 17:21:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:05,348 INFO L93 Difference]: Finished difference Result 321 states and 434 transitions. [2025-01-09 17:21:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 17:21:05,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-01-09 17:21:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:05,350 INFO L225 Difference]: With dead ends: 321 [2025-01-09 17:21:05,350 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 17:21:05,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-01-09 17:21:05,351 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 92 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:05,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 300 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:21:05,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 17:21:05,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2025-01-09 17:21:05,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 118 states have (on average 1.2881355932203389) internal successors, (152), 125 states have internal predecessors, (152), 26 states have call successors, (26), 10 states have call predecessors, (26), 15 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) [2025-01-09 17:21:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 211 transitions. [2025-01-09 17:21:05,370 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 211 transitions. Word has length 70 [2025-01-09 17:21:05,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:05,370 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 211 transitions. [2025-01-09 17:21:05,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 17:21:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 211 transitions. [2025-01-09 17:21:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 17:21:05,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:05,371 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:21:05,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 17:21:05,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:05,576 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:05,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:05,576 INFO L85 PathProgramCache]: Analyzing trace with hash 720644719, now seen corresponding path program 1 times [2025-01-09 17:21:05,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:05,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187490742] [2025-01-09 17:21:05,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:05,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:05,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 17:21:05,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 17:21:05,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:05,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 17:21:05,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:05,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187490742] [2025-01-09 17:21:05,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187490742] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:05,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469597407] [2025-01-09 17:21:05,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:05,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:05,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:05,698 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:21:05,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 17:21:05,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 17:21:05,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 17:21:05,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:05,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:05,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 17:21:05,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 17:21:05,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:21:05,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469597407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:21:05,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:21:05,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-01-09 17:21:05,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469319196] [2025-01-09 17:21:05,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:21:05,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:21:05,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:05,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:21:05,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:21:05,927 INFO L87 Difference]: Start difference. First operand 160 states and 211 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 17:21:06,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:06,117 INFO L93 Difference]: Finished difference Result 345 states and 466 transitions. [2025-01-09 17:21:06,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 17:21:06,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2025-01-09 17:21:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:06,119 INFO L225 Difference]: With dead ends: 345 [2025-01-09 17:21:06,120 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 17:21:06,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2025-01-09 17:21:06,121 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 106 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:06,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 335 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:21:06,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 17:21:06,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 164. [2025-01-09 17:21:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 122 states have (on average 1.278688524590164) internal successors, (156), 129 states have internal predecessors, (156), 26 states have call successors, (26), 10 states have call predecessors, (26), 15 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) [2025-01-09 17:21:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 215 transitions. [2025-01-09 17:21:06,163 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 215 transitions. Word has length 72 [2025-01-09 17:21:06,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:06,163 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 215 transitions. [2025-01-09 17:21:06,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 17:21:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 215 transitions. [2025-01-09 17:21:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 17:21:06,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:06,165 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:21:06,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 17:21:06,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 17:21:06,369 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:06,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:06,369 INFO L85 PathProgramCache]: Analyzing trace with hash 784356687, now seen corresponding path program 1 times [2025-01-09 17:21:06,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:06,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354169483] [2025-01-09 17:21:06,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:06,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:06,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 17:21:06,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 17:21:06,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:06,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 17:21:06,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:06,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354169483] [2025-01-09 17:21:06,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354169483] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:06,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314569104] [2025-01-09 17:21:06,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:06,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:06,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:06,530 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:21:06,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 17:21:06,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 17:21:06,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 17:21:06,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:06,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:06,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 17:21:06,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 17:21:06,683 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:21:06,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314569104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:21:06,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:21:06,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 17:21:06,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968071132] [2025-01-09 17:21:06,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:21:06,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:21:06,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:06,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:21:06,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:21:06,684 INFO L87 Difference]: Start difference. First operand 164 states and 215 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 17:21:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:06,710 INFO L93 Difference]: Finished difference Result 325 states and 446 transitions. [2025-01-09 17:21:06,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:21:06,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-01-09 17:21:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:06,711 INFO L225 Difference]: With dead ends: 325 [2025-01-09 17:21:06,711 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 17:21:06,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:21:06,713 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 147 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-01-09 17:21:06,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 147 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:21:06,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 17:21:06,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2025-01-09 17:21:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 133 states have internal predecessors, (160), 26 states have call successors, (26), 10 states have call predecessors, (26), 15 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) [2025-01-09 17:21:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 219 transitions. [2025-01-09 17:21:06,733 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 219 transitions. Word has length 73 [2025-01-09 17:21:06,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:06,734 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 219 transitions. [2025-01-09 17:21:06,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 17:21:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 219 transitions. [2025-01-09 17:21:06,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 17:21:06,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:06,735 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:21:06,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 17:21:06,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 17:21:06,936 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:06,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:06,936 INFO L85 PathProgramCache]: Analyzing trace with hash 747677329, now seen corresponding path program 1 times [2025-01-09 17:21:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:06,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903545204] [2025-01-09 17:21:06,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:06,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:06,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 17:21:06,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 17:21:06,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:06,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 17:21:07,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:07,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903545204] [2025-01-09 17:21:07,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903545204] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:07,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590972542] [2025-01-09 17:21:07,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:07,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:07,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:07,185 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:21:07,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 17:21:07,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 17:21:07,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 17:21:07,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:07,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:07,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-01-09 17:21:07,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:07,448 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-01-09 17:21:07,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:07,459 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-01-09 17:21:07,464 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-01-09 17:21:07,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:07,468 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-01-09 17:21:07,506 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2025-01-09 17:21:07,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 105 [2025-01-09 17:21:07,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:07,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:07,514 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 28 treesize of output 25 [2025-01-09 17:21:07,520 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 60 treesize of output 50 [2025-01-09 17:21:07,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:07,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2025-01-09 17:21:07,531 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-01-09 17:21:08,391 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 17:21:08,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 17:21:08,635 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 17:21:08,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:21:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 17:21:09,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590972542] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:21:09,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:21:09,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 23, 12] total 38 [2025-01-09 17:21:09,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268508960] [2025-01-09 17:21:09,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:21:09,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 17:21:09,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:09,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 17:21:09,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1289, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 17:21:09,182 INFO L87 Difference]: Start difference. First operand 168 states and 219 transitions. Second operand has 38 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 33 states have internal predecessors, (115), 10 states have call successors, (19), 4 states have call predecessors, (19), 11 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) [2025-01-09 17:21:13,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:21:17,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:21:21,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:21:25,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:21:29,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:21:33,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:21:37,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:21:42,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:42,141 INFO L93 Difference]: Finished difference Result 700 states and 1000 transitions. [2025-01-09 17:21:42,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-01-09 17:21:42,141 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 33 states have internal predecessors, (115), 10 states have call successors, (19), 4 states have call predecessors, (19), 11 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) Word has length 81 [2025-01-09 17:21:42,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:42,144 INFO L225 Difference]: With dead ends: 700 [2025-01-09 17:21:42,144 INFO L226 Difference]: Without dead ends: 542 [2025-01-09 17:21:42,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 147 SyntacticMatches, 4 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2867 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=936, Invalid=9776, Unknown=0, NotChecked=0, Total=10712 [2025-01-09 17:21:42,147 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 238 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 2809 mSolverCounterSat, 146 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 2962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2809 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.6s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:42,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 2212 Invalid, 2962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2809 Invalid, 7 Unknown, 0 Unchecked, 30.6s Time] [2025-01-09 17:21:42,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-01-09 17:21:42,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 379. [2025-01-09 17:21:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 289 states have (on average 1.28719723183391) internal successors, (372), 308 states have internal predecessors, (372), 55 states have call successors, (55), 18 states have call predecessors, (55), 34 states have return successors, (88), 52 states have call predecessors, (88), 51 states have call successors, (88) [2025-01-09 17:21:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 515 transitions. [2025-01-09 17:21:42,192 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 515 transitions. Word has length 81 [2025-01-09 17:21:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:42,192 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 515 transitions. [2025-01-09 17:21:42,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 33 states have internal predecessors, (115), 10 states have call successors, (19), 4 states have call predecessors, (19), 11 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) [2025-01-09 17:21:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 515 transitions. [2025-01-09 17:21:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 17:21:42,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:42,195 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:21:42,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 17:21:42,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:42,396 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:42,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:42,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2106395371, now seen corresponding path program 1 times [2025-01-09 17:21:42,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:42,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345079590] [2025-01-09 17:21:42,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:42,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:42,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 17:21:42,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 17:21:42,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:42,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 17:21:42,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:42,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345079590] [2025-01-09 17:21:42,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345079590] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:42,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320347993] [2025-01-09 17:21:42,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:42,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:42,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:42,823 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:21:42,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 17:21:42,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 17:21:42,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 17:21:42,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:42,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:42,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-01-09 17:21:42,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:43,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 17:21:43,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 17:21:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 17:21:43,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:21:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 17:21:43,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320347993] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:21:43,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:21:43,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 12] total 34 [2025-01-09 17:21:43,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178725597] [2025-01-09 17:21:43,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:21:43,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 17:21:43,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:43,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 17:21:43,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 17:21:43,867 INFO L87 Difference]: Start difference. First operand 379 states and 515 transitions. Second operand has 34 states, 33 states have (on average 3.5757575757575757) internal successors, (118), 34 states have internal predecessors, (118), 10 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (20), 8 states have call predecessors, (20), 10 states have call successors, (20) [2025-01-09 17:21:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:46,207 INFO L93 Difference]: Finished difference Result 1896 states and 2842 transitions. [2025-01-09 17:21:46,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-01-09 17:21:46,208 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.5757575757575757) internal successors, (118), 34 states have internal predecessors, (118), 10 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (20), 8 states have call predecessors, (20), 10 states have call successors, (20) Word has length 83 [2025-01-09 17:21:46,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:46,215 INFO L225 Difference]: With dead ends: 1896 [2025-01-09 17:21:46,216 INFO L226 Difference]: Without dead ends: 1423 [2025-01-09 17:21:46,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=564, Invalid=5288, Unknown=0, NotChecked=0, Total=5852 [2025-01-09 17:21:46,220 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 319 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 2296 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 2435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:46,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 2030 Invalid, 2435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2296 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 17:21:46,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-01-09 17:21:46,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1183. [2025-01-09 17:21:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 942 states have (on average 1.2929936305732483) internal successors, (1218), 990 states have internal predecessors, (1218), 137 states have call successors, (137), 42 states have call predecessors, (137), 103 states have return successors, (308), 150 states have call predecessors, (308), 129 states have call successors, (308) [2025-01-09 17:21:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1663 transitions. [2025-01-09 17:21:46,377 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1663 transitions. Word has length 83 [2025-01-09 17:21:46,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:46,377 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1663 transitions. [2025-01-09 17:21:46,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.5757575757575757) internal successors, (118), 34 states have internal predecessors, (118), 10 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (20), 8 states have call predecessors, (20), 10 states have call successors, (20) [2025-01-09 17:21:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1663 transitions. [2025-01-09 17:21:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 17:21:46,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:46,383 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:21:46,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 17:21:46,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:46,583 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:46,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:46,584 INFO L85 PathProgramCache]: Analyzing trace with hash 739304235, now seen corresponding path program 1 times [2025-01-09 17:21:46,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:46,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564427832] [2025-01-09 17:21:46,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:46,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:46,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 17:21:46,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 17:21:46,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:46,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 17:21:46,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:46,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564427832] [2025-01-09 17:21:46,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564427832] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:46,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929995847] [2025-01-09 17:21:46,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:46,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:46,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:46,646 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:21:46,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 17:21:46,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 17:21:46,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 17:21:46,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:46,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:46,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 17:21:46,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 17:21:46,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:21:46,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929995847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:21:46,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:21:46,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-01-09 17:21:46,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339894110] [2025-01-09 17:21:46,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:21:46,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:21:46,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:46,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:21:46,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:21:46,825 INFO L87 Difference]: Start difference. First operand 1183 states and 1663 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 17:21:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:46,936 INFO L93 Difference]: Finished difference Result 2269 states and 3273 transitions. [2025-01-09 17:21:46,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:21:46,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2025-01-09 17:21:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:46,943 INFO L225 Difference]: With dead ends: 2269 [2025-01-09 17:21:46,943 INFO L226 Difference]: Without dead ends: 1111 [2025-01-09 17:21:46,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 84 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-01-09 17:21:46,949 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 223 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-01-09 17:21:46,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 223 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:21:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2025-01-09 17:21:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1102. [2025-01-09 17:21:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 871 states have (on average 1.2766934557979335) internal successors, (1112), 918 states have internal predecessors, (1112), 128 states have call successors, (128), 42 states have call predecessors, (128), 102 states have return successors, (279), 141 states have call predecessors, (279), 120 states have call successors, (279) [2025-01-09 17:21:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1519 transitions. [2025-01-09 17:21:47,082 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1519 transitions. Word has length 83 [2025-01-09 17:21:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:47,082 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1519 transitions. [2025-01-09 17:21:47,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 17:21:47,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1519 transitions. [2025-01-09 17:21:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 17:21:47,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:47,086 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:21:47,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-09 17:21:47,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 17:21:47,287 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:47,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash -551116053, now seen corresponding path program 1 times [2025-01-09 17:21:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:47,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920355775] [2025-01-09 17:21:47,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:47,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:47,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 17:21:47,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 17:21:47,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:47,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 17:21:47,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:47,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920355775] [2025-01-09 17:21:47,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920355775] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:47,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356882993] [2025-01-09 17:21:47,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:47,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:47,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:47,353 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:21:47,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 17:21:47,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 17:21:47,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 17:21:47,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:47,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:47,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 17:21:47,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 17:21:47,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:21:47,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356882993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:21:47,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:21:47,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-01-09 17:21:47,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321911560] [2025-01-09 17:21:47,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:21:47,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:21:47,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:47,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:21:47,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:21:47,539 INFO L87 Difference]: Start difference. First operand 1102 states and 1519 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 17:21:47,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:47,601 INFO L93 Difference]: Finished difference Result 1508 states and 2136 transitions. [2025-01-09 17:21:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:21:47,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2025-01-09 17:21:47,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:47,604 INFO L225 Difference]: With dead ends: 1508 [2025-01-09 17:21:47,604 INFO L226 Difference]: Without dead ends: 431 [2025-01-09 17:21:47,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 84 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-01-09 17:21:47,609 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:47,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 223 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:21:47,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-01-09 17:21:47,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 406. [2025-01-09 17:21:47,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 311 states have (on average 1.2443729903536977) internal successors, (387), 331 states have internal predecessors, (387), 57 states have call successors, (57), 18 states have call predecessors, (57), 37 states have return successors, (92), 56 states have call predecessors, (92), 53 states have call successors, (92) [2025-01-09 17:21:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 536 transitions. [2025-01-09 17:21:47,647 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 536 transitions. Word has length 83 [2025-01-09 17:21:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:47,648 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 536 transitions. [2025-01-09 17:21:47,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 17:21:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 536 transitions. [2025-01-09 17:21:47,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 17:21:47,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:47,649 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 17:21:47,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-09 17:21:47,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 17:21:47,850 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:47,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:47,850 INFO L85 PathProgramCache]: Analyzing trace with hash 21334995, now seen corresponding path program 1 times [2025-01-09 17:21:47,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:47,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748745943] [2025-01-09 17:21:47,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:47,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:47,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 17:21:47,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 17:21:47,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:47,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 17:21:48,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:48,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748745943] [2025-01-09 17:21:48,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748745943] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:48,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124035960] [2025-01-09 17:21:48,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:48,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:48,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:48,032 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:21:48,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-09 17:21:48,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 17:21:48,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 17:21:48,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:48,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:48,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 17:21:48,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 17:21:48,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:21:48,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124035960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:21:48,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:21:48,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-01-09 17:21:48,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409726672] [2025-01-09 17:21:48,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:21:48,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:21:48,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:48,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:21:48,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 17:21:48,243 INFO L87 Difference]: Start difference. First operand 406 states and 536 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 17:21:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:48,294 INFO L93 Difference]: Finished difference Result 790 states and 1091 transitions. [2025-01-09 17:21:48,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:21:48,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2025-01-09 17:21:48,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:48,297 INFO L225 Difference]: With dead ends: 790 [2025-01-09 17:21:48,298 INFO L226 Difference]: Without dead ends: 409 [2025-01-09 17:21:48,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 17:21:48,300 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:48,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:21:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-01-09 17:21:48,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2025-01-09 17:21:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 311 states have (on average 1.2315112540192925) internal successors, (383), 331 states have internal predecessors, (383), 57 states have call successors, (57), 18 states have call predecessors, (57), 37 states have return successors, (92), 56 states have call predecessors, (92), 53 states have call successors, (92) [2025-01-09 17:21:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 532 transitions. [2025-01-09 17:21:48,346 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 532 transitions. Word has length 84 [2025-01-09 17:21:48,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:48,347 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 532 transitions. [2025-01-09 17:21:48,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 17:21:48,347 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 532 transitions. [2025-01-09 17:21:48,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 17:21:48,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:48,349 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 17:21:48,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-09 17:21:48,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:48,550 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:48,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:48,550 INFO L85 PathProgramCache]: Analyzing trace with hash 865340497, now seen corresponding path program 1 times [2025-01-09 17:21:48,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:48,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687394579] [2025-01-09 17:21:48,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:48,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:48,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 17:21:48,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 17:21:48,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:48,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 17:21:49,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:49,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687394579] [2025-01-09 17:21:49,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687394579] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:49,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587428558] [2025-01-09 17:21:49,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:49,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:49,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:49,165 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:21:49,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-09 17:21:49,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 17:21:49,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 17:21:49,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:49,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:49,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-01-09 17:21:49,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:49,427 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-01-09 17:21:49,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:49,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 17:21:49,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:49,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:49,487 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 19 [2025-01-09 17:21:49,493 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-01-09 17:21:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 17:21:50,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:21:50,244 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1512 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 16) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1512))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset|)))) is different from false [2025-01-09 17:21:50,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:50,253 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 42 treesize of output 35 [2025-01-09 17:21:50,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:50,271 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 171 treesize of output 185 [2025-01-09 17:21:50,283 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 184 treesize of output 176 [2025-01-09 17:21:50,338 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-01-09 17:21:50,389 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-01-09 17:21:50,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:50,400 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 23 treesize of output 27 [2025-01-09 17:21:50,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:50,421 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 85 treesize of output 87 [2025-01-09 17:21:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2025-01-09 17:21:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587428558] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:21:50,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:21:50,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 34 [2025-01-09 17:21:50,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784189806] [2025-01-09 17:21:50,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:21:50,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 17:21:50,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:50,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 17:21:50,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=949, Unknown=1, NotChecked=62, Total=1122 [2025-01-09 17:21:50,565 INFO L87 Difference]: Start difference. First operand 406 states and 532 transitions. Second operand has 34 states, 31 states have (on average 4.32258064516129) internal successors, (134), 34 states have internal predecessors, (134), 13 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (22), 10 states have call predecessors, (22), 13 states have call successors, (22) [2025-01-09 17:21:51,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:51,622 INFO L93 Difference]: Finished difference Result 802 states and 1070 transitions. [2025-01-09 17:21:51,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 17:21:51,622 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 4.32258064516129) internal successors, (134), 34 states have internal predecessors, (134), 13 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (22), 10 states have call predecessors, (22), 13 states have call successors, (22) Word has length 84 [2025-01-09 17:21:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:51,625 INFO L225 Difference]: With dead ends: 802 [2025-01-09 17:21:51,625 INFO L226 Difference]: Without dead ends: 486 [2025-01-09 17:21:51,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 147 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=1464, Unknown=1, NotChecked=78, Total=1722 [2025-01-09 17:21:51,628 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 123 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:51,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1380 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1087 Invalid, 0 Unknown, 147 Unchecked, 0.8s Time] [2025-01-09 17:21:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-01-09 17:21:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 412. [2025-01-09 17:21:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 317 states have (on average 1.227129337539432) internal successors, (389), 337 states have internal predecessors, (389), 57 states have call successors, (57), 18 states have call predecessors, (57), 37 states have return successors, (92), 56 states have call predecessors, (92), 53 states have call successors, (92) [2025-01-09 17:21:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 538 transitions. [2025-01-09 17:21:51,689 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 538 transitions. Word has length 84 [2025-01-09 17:21:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:51,690 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 538 transitions. [2025-01-09 17:21:51,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 4.32258064516129) internal successors, (134), 34 states have internal predecessors, (134), 13 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (22), 10 states have call predecessors, (22), 13 states have call successors, (22) [2025-01-09 17:21:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 538 transitions. [2025-01-09 17:21:51,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 17:21:51,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:51,691 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 17:21:51,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-01-09 17:21:51,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 17:21:51,892 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:51,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:51,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1804945971, now seen corresponding path program 1 times [2025-01-09 17:21:51,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:51,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292112400] [2025-01-09 17:21:51,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:51,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:51,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 17:21:51,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 17:21:51,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:51,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 17:21:52,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:52,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292112400] [2025-01-09 17:21:52,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292112400] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:52,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959628238] [2025-01-09 17:21:52,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:52,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:52,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:52,052 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:21:52,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-09 17:21:52,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 17:21:52,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 17:21:52,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:52,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:52,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 17:21:52,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 17:21:52,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:21:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 17:21:52,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959628238] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:21:52,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:21:52,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2025-01-09 17:21:52,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737524745] [2025-01-09 17:21:52,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:21:52,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 17:21:52,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:52,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 17:21:52,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2025-01-09 17:21:52,627 INFO L87 Difference]: Start difference. First operand 412 states and 538 transitions. Second operand has 25 states, 22 states have (on average 5.636363636363637) internal successors, (124), 25 states have internal predecessors, (124), 12 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (24), 6 states have call predecessors, (24), 12 states have call successors, (24) [2025-01-09 17:21:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:53,004 INFO L93 Difference]: Finished difference Result 984 states and 1321 transitions. [2025-01-09 17:21:53,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 17:21:53,005 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.636363636363637) internal successors, (124), 25 states have internal predecessors, (124), 12 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (24), 6 states have call predecessors, (24), 12 states have call successors, (24) Word has length 94 [2025-01-09 17:21:53,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:53,008 INFO L225 Difference]: With dead ends: 984 [2025-01-09 17:21:53,008 INFO L226 Difference]: Without dead ends: 455 [2025-01-09 17:21:53,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 17:21:53,011 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 201 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:53,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 554 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:21:53,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-01-09 17:21:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 407. [2025-01-09 17:21:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 313 states have (on average 1.2236421725239617) internal successors, (383), 334 states have internal predecessors, (383), 57 states have call successors, (57), 18 states have call predecessors, (57), 36 states have return successors, (88), 54 states have call predecessors, (88), 53 states have call successors, (88) [2025-01-09 17:21:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 528 transitions. [2025-01-09 17:21:53,058 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 528 transitions. Word has length 94 [2025-01-09 17:21:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:53,059 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 528 transitions. [2025-01-09 17:21:53,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.636363636363637) internal successors, (124), 25 states have internal predecessors, (124), 12 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (24), 6 states have call predecessors, (24), 12 states have call successors, (24) [2025-01-09 17:21:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 528 transitions. [2025-01-09 17:21:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 17:21:53,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:53,060 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 17:21:53,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-01-09 17:21:53,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 17:21:53,261 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:53,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:53,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1808852911, now seen corresponding path program 1 times [2025-01-09 17:21:53,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:53,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122572374] [2025-01-09 17:21:53,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:53,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:53,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 17:21:53,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 17:21:53,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:53,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 17:21:53,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:53,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122572374] [2025-01-09 17:21:53,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122572374] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:53,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184503074] [2025-01-09 17:21:53,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:53,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:53,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:53,513 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:21:53,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-09 17:21:53,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 17:21:53,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 17:21:53,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:53,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:53,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-01-09 17:21:53,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:53,812 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-01-09 17:21:53,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:53,820 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-01-09 17:21:53,825 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-01-09 17:21:53,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:53,830 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-01-09 17:21:53,866 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2025-01-09 17:21:53,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 105 [2025-01-09 17:21:53,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:53,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:53,879 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 28 treesize of output 25 [2025-01-09 17:21:53,882 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 60 treesize of output 50 [2025-01-09 17:21:53,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:53,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2025-01-09 17:21:53,892 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-01-09 17:21:54,589 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 17:21:54,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 17:21:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 24 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 17:21:55,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:21:55,997 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 24)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24))) (and (or (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_1720 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1720))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset|) 0)) (forall ((v_ArrVal_1722 (Array Int Int))) (not (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1722))) (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse3) 0)))) (forall ((v_ArrVal_1722 (Array Int Int))) (let ((.cse4 (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1722))) (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|))) (or (not (= (select .cse4 .cse3) 0)) (= (select .cse4 |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset|) 0)))))) is different from false [2025-01-09 17:21:56,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:56,008 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 165 treesize of output 126 [2025-01-09 17:21:56,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:56,021 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 161 treesize of output 154 [2025-01-09 17:21:56,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:56,037 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 625 treesize of output 559 [2025-01-09 17:21:56,068 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 545 treesize of output 529 [2025-01-09 17:21:56,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:56,157 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 660 treesize of output 674 [2025-01-09 17:21:56,172 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 667 treesize of output 659 [2025-01-09 17:21:56,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:56,191 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 701 treesize of output 677