./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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_prev_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 3cfefcdaebfc0d2ae96a13658913db77eb9f3dde98071b7e2682ec197ecbe65d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:53:04,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:53:04,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:53:04,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:53:04,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:53:04,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:53:04,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:53:04,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:53:04,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:53:04,374 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:53:04,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:53:04,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:53:04,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:53:04,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:53:04,375 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:53:04,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:53:04,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:53:04,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:53:04,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:53:04,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:53:04,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:53:04,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:53:04,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:53:04,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:53:04,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:53:04,376 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:53:04,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:53:04,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:53:04,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:53:04,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:53:04,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:53:04,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:53:04,376 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:53:04,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:53:04,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:53:04,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:53:04,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:53:04,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:53:04,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:53:04,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:53:04,377 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 -> 3cfefcdaebfc0d2ae96a13658913db77eb9f3dde98071b7e2682ec197ecbe65d [2025-02-08 01:53:04,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:53:04,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:53:04,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:53:04,583 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:53:04,583 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:53:04,585 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_prev_harness.i [2025-02-08 01:53:05,756 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/108680a4e/e41b34197a5f48019e66bfd55e577257/FLAGb418bd89a [2025-02-08 01:53:06,162 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:53:06,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2025-02-08 01:53:06,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/108680a4e/e41b34197a5f48019e66bfd55e577257/FLAGb418bd89a [2025-02-08 01:53:06,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/108680a4e/e41b34197a5f48019e66bfd55e577257 [2025-02-08 01:53:06,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:53:06,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:53:06,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:53:06,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:53:06,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:53:06,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:53:06" (1/1) ... [2025-02-08 01:53:06,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44577c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:06, skipping insertion in model container [2025-02-08 01:53:06,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:53:06" (1/1) ... [2025-02-08 01:53:06,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:53:06,553 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_prev_harness.i[4494,4507] [2025-02-08 01:53:06,558 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_prev_harness.i[4554,4567] [2025-02-08 01:53:06,965 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:06,966 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:06,970 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:06,970 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:06,971 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:06,986 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:06,986 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:06,987 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:06,988 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:06,991 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:06,991 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:06,993 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:06,993 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:07,292 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_prev_harness.i[150478,150491] [2025-02-08 01:53:07,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:53:07,302 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:53:07,312 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_prev_harness.i[4494,4507] [2025-02-08 01:53:07,314 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_prev_harness.i[4554,4567] [2025-02-08 01:53:07,359 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:07,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:07,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:07,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:07,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:07,372 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:07,372 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:07,373 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:07,373 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:07,374 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:07,375 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:07,375 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:07,375 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:07,450 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_prev_harness.i[150478,150491] [2025-02-08 01:53:07,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:53:07,596 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:53:07,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:07 WrapperNode [2025-02-08 01:53:07,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:53:07,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:53:07,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:53:07,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:53:07,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:07" (1/1) ... [2025-02-08 01:53:07,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:07" (1/1) ... [2025-02-08 01:53:07,691 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 51, calls inlined = 4, statements flattened = 56 [2025-02-08 01:53:07,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:53:07,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:53:07,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:53:07,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:53:07,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:07" (1/1) ... [2025-02-08 01:53:07,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:07" (1/1) ... [2025-02-08 01:53:07,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:07" (1/1) ... [2025-02-08 01:53:07,721 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 4, 6]. 35 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 2 writes are split as follows [0, 0, 1, 1]. [2025-02-08 01:53:07,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:07" (1/1) ... [2025-02-08 01:53:07,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:07" (1/1) ... [2025-02-08 01:53:07,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:07" (1/1) ... [2025-02-08 01:53:07,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:07" (1/1) ... [2025-02-08 01:53:07,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:07" (1/1) ... [2025-02-08 01:53:07,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:07" (1/1) ... [2025-02-08 01:53:07,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:53:07,745 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:53:07,745 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:53:07,745 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:53:07,746 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:07" (1/1) ... [2025-02-08 01:53:07,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:53:07,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:53:07,779 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-02-08 01:53:07,785 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-02-08 01:53:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:53:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:53:07,806 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:53:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:53:07,806 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:53:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:53:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:53:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:53:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:53:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 01:53:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:53:07,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:53:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:53:07,807 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:53:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:53:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:53:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:53:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:53:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 01:53:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:53:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:53:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:53:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 01:53:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:53:07,807 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:53:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:53:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:53:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:53:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 01:53:07,960 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:53:07,962 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:53:08,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4720: havoc #t~mem308.base, #t~mem308.offset;havoc #t~short309;havoc #t~mem310.base, #t~mem310.offset;havoc #t~mem311.base, #t~mem311.offset;havoc #t~short312; [2025-02-08 01:53:08,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4731: havoc #t~mem313.base, #t~mem313.offset;havoc #t~short314;havoc #t~mem315.base, #t~mem315.offset;havoc #t~mem316.base, #t~mem316.offset;havoc #t~short317; [2025-02-08 01:53:08,095 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-02-08 01:53:08,095 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:53:08,104 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:53:08,105 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:53:08,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:53:08 BoogieIcfgContainer [2025-02-08 01:53:08,106 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:53:08,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:53:08,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:53:08,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:53:08,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:53:06" (1/3) ... [2025-02-08 01:53:08,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3884690a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:53:08, skipping insertion in model container [2025-02-08 01:53:08,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:07" (2/3) ... [2025-02-08 01:53:08,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3884690a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:53:08, skipping insertion in model container [2025-02-08 01:53:08,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:53:08" (3/3) ... [2025-02-08 01:53:08,112 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_prev_harness.i [2025-02-08 01:53:08,122 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:53:08,123 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_prev_harness.i that has 5 procedures, 46 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-08 01:53:08,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:53:08,163 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;@309d6c63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:53:08,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:53:08,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 01:53:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 01:53:08,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:08,169 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:53:08,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:08,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:08,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2094505667, now seen corresponding path program 1 times [2025-02-08 01:53:08,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:08,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895057075] [2025-02-08 01:53:08,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:08,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:08,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:53:08,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:53:08,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:08,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:53:08,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:08,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895057075] [2025-02-08 01:53:08,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895057075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:08,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:53:08,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:53:08,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012662083] [2025-02-08 01:53:08,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:08,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:53:08,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:08,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:53:08,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:53:08,438 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 01:53:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:08,452 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2025-02-08 01:53:08,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:53:08,453 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-02-08 01:53:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:08,458 INFO L225 Difference]: With dead ends: 87 [2025-02-08 01:53:08,458 INFO L226 Difference]: Without dead ends: 43 [2025-02-08 01:53:08,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-02-08 01:53:08,463 INFO L435 NwaCegarLoop]: 57 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, 57 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-02-08 01:53:08,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:53:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-08 01:53:08,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-08 01:53:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 01:53:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2025-02-08 01:53:08,485 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 27 [2025-02-08 01:53:08,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:08,485 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2025-02-08 01:53:08,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 01:53:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2025-02-08 01:53:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 01:53:08,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:08,487 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:53:08,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:53:08,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:08,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:08,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1583971490, now seen corresponding path program 1 times [2025-02-08 01:53:08,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:08,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55911119] [2025-02-08 01:53:08,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:08,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:08,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:53:08,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:53:08,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:08,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:53:09,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:09,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55911119] [2025-02-08 01:53:09,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55911119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:09,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:53:09,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:53:09,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43252843] [2025-02-08 01:53:09,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:09,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:53:09,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:09,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:53:09,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:53:09,598 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 01:53:09,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:09,754 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2025-02-08 01:53:09,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:53:09,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-02-08 01:53:09,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:09,756 INFO L225 Difference]: With dead ends: 54 [2025-02-08 01:53:09,756 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 01:53:09,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:53:09,757 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 9 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:09,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 296 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:53:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 01:53:09,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-02-08 01:53:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-02-08 01:53:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2025-02-08 01:53:09,763 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 27 [2025-02-08 01:53:09,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:09,764 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2025-02-08 01:53:09,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 01:53:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2025-02-08 01:53:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 01:53:09,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:09,764 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:53:09,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:53:09,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:09,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:09,765 INFO L85 PathProgramCache]: Analyzing trace with hash -968185471, now seen corresponding path program 1 times [2025-02-08 01:53:09,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:09,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835050156] [2025-02-08 01:53:09,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:09,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:09,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:53:09,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:53:09,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:09,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:53:10,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:10,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835050156] [2025-02-08 01:53:10,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835050156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:10,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:53:10,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:53:10,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241081410] [2025-02-08 01:53:10,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:10,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:53:10,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:10,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:53:10,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:53:10,192 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 01:53:10,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:10,320 INFO L93 Difference]: Finished difference Result 105 states and 132 transitions. [2025-02-08 01:53:10,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:53:10,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-02-08 01:53:10,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:10,321 INFO L225 Difference]: With dead ends: 105 [2025-02-08 01:53:10,321 INFO L226 Difference]: Without dead ends: 56 [2025-02-08 01:53:10,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:53:10,322 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 11 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:10,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 191 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:53:10,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-08 01:53:10,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-08 01:53:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 38 states have internal predecessors, (41), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 01:53:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-02-08 01:53:10,347 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 27 [2025-02-08 01:53:10,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:10,348 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-02-08 01:53:10,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 01:53:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2025-02-08 01:53:10,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 01:53:10,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:10,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:53:10,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:53:10,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:10,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:10,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1164698976, now seen corresponding path program 1 times [2025-02-08 01:53:10,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:10,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932316587] [2025-02-08 01:53:10,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:10,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:53:10,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:53:10,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:10,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:53:10,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:10,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932316587] [2025-02-08 01:53:10,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932316587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:10,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:53:10,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:53:10,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890610476] [2025-02-08 01:53:10,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:10,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:53:10,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:10,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:53:10,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:53:10,452 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 01:53:10,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:10,485 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2025-02-08 01:53:10,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:53:10,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-02-08 01:53:10,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:10,488 INFO L225 Difference]: With dead ends: 112 [2025-02-08 01:53:10,488 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 01:53:10,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:53:10,489 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 3 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:10,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 145 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:53:10,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 01:53:10,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2025-02-08 01:53:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2025-02-08 01:53:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2025-02-08 01:53:10,500 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 27 [2025-02-08 01:53:10,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:10,500 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2025-02-08 01:53:10,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 01:53:10,500 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2025-02-08 01:53:10,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 01:53:10,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:10,501 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 01:53:10,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:53:10,501 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:10,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:10,501 INFO L85 PathProgramCache]: Analyzing trace with hash -629387051, now seen corresponding path program 1 times [2025-02-08 01:53:10,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:10,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298164863] [2025-02-08 01:53:10,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:10,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:10,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 01:53:10,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 01:53:10,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:10,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 01:53:11,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:11,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298164863] [2025-02-08 01:53:11,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298164863] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:53:11,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600115451] [2025-02-08 01:53:11,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:11,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:53:11,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:53:11,398 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-02-08 01:53:11,399 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-02-08 01:53:11,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 01:53:11,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 01:53:11,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:11,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:11,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-08 01:53:11,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:53:11,581 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 23 treesize of output 13 [2025-02-08 01:53:11,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 01:53:11,591 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 23 treesize of output 13 [2025-02-08 01:53:11,596 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 19 treesize of output 1 [2025-02-08 01:53:12,585 INFO L349 Elim1Store]: treesize reduction 25, result has 39.0 percent of original size [2025-02-08 01:53:12,586 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 193 treesize of output 112 [2025-02-08 01:53:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:53:12,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:53:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:53:13,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600115451] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:53:13,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:53:13,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 12] total 30 [2025-02-08 01:53:13,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441736492] [2025-02-08 01:53:13,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:13,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:53:13,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:13,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:53:13,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2025-02-08 01:53:13,071 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 01:53:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:13,338 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2025-02-08 01:53:13,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:53:13,339 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2025-02-08 01:53:13,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:13,340 INFO L225 Difference]: With dead ends: 63 [2025-02-08 01:53:13,341 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 01:53:13,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 01:53:13,342 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 11 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:13,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 328 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 01:53:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 01:53:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-02-08 01:53:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 41 states have internal predecessors, (44), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-02-08 01:53:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2025-02-08 01:53:13,356 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 41 [2025-02-08 01:53:13,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:13,356 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2025-02-08 01:53:13,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 01:53:13,356 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2025-02-08 01:53:13,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 01:53:13,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:13,357 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 01:53:13,368 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-02-08 01:53:13,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:53:13,558 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:13,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:13,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1113423284, now seen corresponding path program 1 times [2025-02-08 01:53:13,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:13,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521322420] [2025-02-08 01:53:13,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:13,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:13,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 01:53:13,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 01:53:13,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:13,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:53:14,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:14,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521322420] [2025-02-08 01:53:14,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521322420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:14,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:53:14,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-08 01:53:14,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123714618] [2025-02-08 01:53:14,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:14,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 01:53:14,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:14,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 01:53:14,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-02-08 01:53:14,083 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 01:53:14,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:14,422 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2025-02-08 01:53:14,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 01:53:14,422 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2025-02-08 01:53:14,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:14,423 INFO L225 Difference]: With dead ends: 110 [2025-02-08 01:53:14,423 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 01:53:14,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-02-08 01:53:14,424 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 16 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:14,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 402 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 01:53:14,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 01:53:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-02-08 01:53:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 46 states have internal predecessors, (49), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 01:53:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2025-02-08 01:53:14,430 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 41 [2025-02-08 01:53:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:14,431 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2025-02-08 01:53:14,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 01:53:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2025-02-08 01:53:14,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 01:53:14,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:14,431 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 01:53:14,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:53:14,431 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:14,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash 916909779, now seen corresponding path program 1 times [2025-02-08 01:53:14,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:14,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073955389] [2025-02-08 01:53:14,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:14,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:14,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 01:53:14,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 01:53:14,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:14,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:53:14,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:14,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073955389] [2025-02-08 01:53:14,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073955389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:14,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:53:14,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:53:14,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705625873] [2025-02-08 01:53:14,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:14,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:53:14,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:14,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:53:14,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:53:14,567 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 01:53:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:14,617 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2025-02-08 01:53:14,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:53:14,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2025-02-08 01:53:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:14,618 INFO L225 Difference]: With dead ends: 116 [2025-02-08 01:53:14,618 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 01:53:14,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:53:14,619 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:14,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 227 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:53:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 01:53:14,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2025-02-08 01:53:14,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-08 01:53:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-02-08 01:53:14,624 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 41 [2025-02-08 01:53:14,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:14,624 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-02-08 01:53:14,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 01:53:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2025-02-08 01:53:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 01:53:14,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:14,625 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-08 01:53:14,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:53:14,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:14,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:14,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1431001715, now seen corresponding path program 1 times [2025-02-08 01:53:14,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:14,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208985288] [2025-02-08 01:53:14,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:14,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:14,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 01:53:14,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 01:53:14,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:14,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 01:53:14,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:14,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208985288] [2025-02-08 01:53:14,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208985288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:14,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:53:14,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:53:14,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789606402] [2025-02-08 01:53:14,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:14,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:53:14,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:14,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:53:14,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:53:14,742 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 01:53:14,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:14,811 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2025-02-08 01:53:14,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:53:14,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2025-02-08 01:53:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:14,815 INFO L225 Difference]: With dead ends: 67 [2025-02-08 01:53:14,815 INFO L226 Difference]: Without dead ends: 65 [2025-02-08 01:53:14,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:53:14,816 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:14,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 229 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:53:14,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-08 01:53:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-08 01:53:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 46 states have internal predecessors, (50), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-08 01:53:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2025-02-08 01:53:14,822 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 47 [2025-02-08 01:53:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:14,822 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2025-02-08 01:53:14,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 01:53:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2025-02-08 01:53:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 01:53:14,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:14,823 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:53:14,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:53:14,823 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:14,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:14,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2052165273, now seen corresponding path program 1 times [2025-02-08 01:53:14,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:14,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233593458] [2025-02-08 01:53:14,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:14,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:14,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 01:53:14,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 01:53:14,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:14,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-08 01:53:15,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:15,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233593458] [2025-02-08 01:53:15,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233593458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:15,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:53:15,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:53:15,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277462458] [2025-02-08 01:53:15,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:15,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:53:15,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:15,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:53:15,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:53:15,360 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-08 01:53:15,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:15,502 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2025-02-08 01:53:15,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:53:15,502 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2025-02-08 01:53:15,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:15,503 INFO L225 Difference]: With dead ends: 76 [2025-02-08 01:53:15,503 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 01:53:15,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:53:15,503 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 10 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:15,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 286 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:53:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 01:53:15,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2025-02-08 01:53:15,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-02-08 01:53:15,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2025-02-08 01:53:15,510 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 61 [2025-02-08 01:53:15,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:15,510 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2025-02-08 01:53:15,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-08 01:53:15,510 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2025-02-08 01:53:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 01:53:15,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:15,511 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:53:15,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:53:15,511 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:15,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:15,511 INFO L85 PathProgramCache]: Analyzing trace with hash -309354938, now seen corresponding path program 1 times [2025-02-08 01:53:15,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:15,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980035753] [2025-02-08 01:53:15,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:15,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 01:53:15,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 01:53:15,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:15,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-08 01:53:15,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:15,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980035753] [2025-02-08 01:53:15,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980035753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:15,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:53:15,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:53:15,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234539071] [2025-02-08 01:53:15,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:15,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:53:15,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:15,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:53:15,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:53:15,777 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-08 01:53:15,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:15,908 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2025-02-08 01:53:15,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:53:15,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2025-02-08 01:53:15,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:15,910 INFO L225 Difference]: With dead ends: 100 [2025-02-08 01:53:15,910 INFO L226 Difference]: Without dead ends: 73 [2025-02-08 01:53:15,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:53:15,910 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 12 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:15,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 183 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:53:15,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-08 01:53:15,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-02-08 01:53:15,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.125) internal successors, (54), 52 states have internal predecessors, (54), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-02-08 01:53:15,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2025-02-08 01:53:15,918 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 61 [2025-02-08 01:53:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:15,918 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2025-02-08 01:53:15,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-08 01:53:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2025-02-08 01:53:15,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 01:53:15,919 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:15,919 INFO L218 NwaCegarLoop]: trace histogram [4, 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-02-08 01:53:15,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:53:15,919 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:15,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:15,919 INFO L85 PathProgramCache]: Analyzing trace with hash -505868443, now seen corresponding path program 1 times [2025-02-08 01:53:15,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:15,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54036866] [2025-02-08 01:53:15,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:15,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:15,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 01:53:15,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 01:53:15,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:15,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-08 01:53:15,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:15,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54036866] [2025-02-08 01:53:15,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54036866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:15,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:53:15,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:53:15,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835239954] [2025-02-08 01:53:15,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:15,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:53:15,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:15,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:53:15,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:53:15,998 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-08 01:53:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:16,012 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2025-02-08 01:53:16,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:53:16,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2025-02-08 01:53:16,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:16,013 INFO L225 Difference]: With dead ends: 101 [2025-02-08 01:53:16,013 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 01:53:16,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:53:16,014 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 3 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:16,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 186 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:53:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 01:53:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-08 01:53:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 44 states have internal predecessors, (46), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2025-02-08 01:53:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2025-02-08 01:53:16,024 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 61 [2025-02-08 01:53:16,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:16,024 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2025-02-08 01:53:16,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-08 01:53:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2025-02-08 01:53:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-08 01:53:16,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:16,025 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 01:53:16,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:53:16,025 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:16,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:16,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1382348762, now seen corresponding path program 1 times [2025-02-08 01:53:16,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:16,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622705278] [2025-02-08 01:53:16,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:16,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:16,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 01:53:16,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 01:53:16,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:16,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-08 01:53:17,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:17,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622705278] [2025-02-08 01:53:17,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622705278] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:53:17,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276142905] [2025-02-08 01:53:17,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:17,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:53:17,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:53:17,525 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-02-08 01:53:17,526 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-02-08 01:53:17,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 01:53:17,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 01:53:17,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:17,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:17,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-02-08 01:53:17,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:53:17,665 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 11 treesize of output 7 [2025-02-08 01:53:17,668 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 19 treesize of output 11 [2025-02-08 01:53:17,672 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 19 treesize of output 11 [2025-02-08 01:53:17,677 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 15 treesize of output 1 [2025-02-08 01:53:19,461 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-02-08 01:53:19,461 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 87 [2025-02-08 01:53:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-08 01:53:19,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:53:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-08 01:53:42,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276142905] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:53:42,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:53:42,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 53 [2025-02-08 01:53:42,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3578287] [2025-02-08 01:53:42,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:53:42,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-02-08 01:53:42,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:42,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-02-08 01:53:42,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2530, Unknown=4, NotChecked=0, Total=2756 [2025-02-08 01:53:42,145 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 53 states, 44 states have (on average 2.227272727272727) internal successors, (98), 42 states have internal predecessors, (98), 19 states have call successors, (33), 4 states have call predecessors, (33), 11 states have return successors, (30), 19 states have call predecessors, (30), 16 states have call successors, (30) [2025-02-08 01:53:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:43,484 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2025-02-08 01:53:43,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 01:53:43,485 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 44 states have (on average 2.227272727272727) internal successors, (98), 42 states have internal predecessors, (98), 19 states have call successors, (33), 4 states have call predecessors, (33), 11 states have return successors, (30), 19 states have call predecessors, (30), 16 states have call successors, (30) Word has length 75 [2025-02-08 01:53:43,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:43,485 INFO L225 Difference]: With dead ends: 75 [2025-02-08 01:53:43,485 INFO L226 Difference]: Without dead ends: 73 [2025-02-08 01:53:43,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 108 SyntacticMatches, 14 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=371, Invalid=4047, Unknown=4, NotChecked=0, Total=4422 [2025-02-08 01:53:43,487 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 41 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:43,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 465 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 01:53:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-08 01:53:43,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2025-02-08 01:53:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 50 states have internal predecessors, (51), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-02-08 01:53:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2025-02-08 01:53:43,495 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 75 [2025-02-08 01:53:43,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:43,495 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2025-02-08 01:53:43,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 44 states have (on average 2.227272727272727) internal successors, (98), 42 states have internal predecessors, (98), 19 states have call successors, (33), 4 states have call predecessors, (33), 11 states have return successors, (30), 19 states have call predecessors, (30), 16 states have call successors, (30) [2025-02-08 01:53:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2025-02-08 01:53:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-08 01:53:43,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:43,496 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:53:43,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 01:53:43,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:53:43,697 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:43,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:43,697 INFO L85 PathProgramCache]: Analyzing trace with hash 360461573, now seen corresponding path program 1 times [2025-02-08 01:53:43,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:43,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563109677] [2025-02-08 01:53:43,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:43,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:43,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 01:53:43,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 01:53:43,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:43,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-08 01:53:44,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:44,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563109677] [2025-02-08 01:53:44,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563109677] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:53:44,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38237298] [2025-02-08 01:53:44,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:44,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:53:44,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:53:44,048 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-02-08 01:53:44,049 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-02-08 01:53:44,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 01:53:44,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 01:53:44,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:44,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:44,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 01:53:44,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:53:44,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 01:53:44,179 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 19 treesize of output 1 [2025-02-08 01:53:44,183 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 23 treesize of output 13 [2025-02-08 01:53:44,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-08 01:53:44,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2025-02-08 01:53:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-08 01:53:44,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:53:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:53:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38237298] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:53:45,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:53:45,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 10] total 27 [2025-02-08 01:53:45,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964647773] [2025-02-08 01:53:45,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:45,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:53:45,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:45,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:53:45,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2025-02-08 01:53:45,218 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-08 01:53:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:45,571 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2025-02-08 01:53:45,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:53:45,574 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 75 [2025-02-08 01:53:45,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:45,575 INFO L225 Difference]: With dead ends: 84 [2025-02-08 01:53:45,575 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 01:53:45,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 118 SyntacticMatches, 17 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2025-02-08 01:53:45,577 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:45,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 164 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 01:53:45,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 01:53:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-08 01:53:45,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 50 states have internal predecessors, (50), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-02-08 01:53:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2025-02-08 01:53:45,595 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 75 [2025-02-08 01:53:45,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:45,602 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2025-02-08 01:53:45,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-08 01:53:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2025-02-08 01:53:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-08 01:53:45,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:45,603 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2025-02-08 01:53:45,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 01:53:45,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:53:45,803 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:45,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:45,804 INFO L85 PathProgramCache]: Analyzing trace with hash 163948068, now seen corresponding path program 1 times [2025-02-08 01:53:45,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:45,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852825672] [2025-02-08 01:53:45,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:45,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:45,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 01:53:45,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 01:53:45,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:45,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:53:46,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:46,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852825672] [2025-02-08 01:53:46,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852825672] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:53:46,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516896046] [2025-02-08 01:53:46,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:46,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:53:46,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:53:46,089 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-02-08 01:53:46,091 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-02-08 01:53:46,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 01:53:46,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 01:53:46,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:46,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:46,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 01:53:46,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:53:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-08 01:53:46,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:53:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:53:46,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516896046] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:53:46,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:53:46,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 9 [2025-02-08 01:53:46,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293961888] [2025-02-08 01:53:46,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:53:46,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:53:46,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:46,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:53:46,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:53:46,534 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-08 01:53:46,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:46,616 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2025-02-08 01:53:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:53:46,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 75 [2025-02-08 01:53:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:46,619 INFO L225 Difference]: With dead ends: 95 [2025-02-08 01:53:46,619 INFO L226 Difference]: Without dead ends: 63 [2025-02-08 01:53:46,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:53:46,619 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 5 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:46,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 267 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:53:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-08 01:53:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-02-08 01:53:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.0) internal successors, (40), 40 states have internal predecessors, (40), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 01:53:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2025-02-08 01:53:46,630 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 75 [2025-02-08 01:53:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:46,630 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2025-02-08 01:53:46,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-08 01:53:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2025-02-08 01:53:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 01:53:46,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:46,631 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 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-02-08 01:53:46,638 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-02-08 01:53:46,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-08 01:53:46,835 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:46,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:46,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1862344234, now seen corresponding path program 1 times [2025-02-08 01:53:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:46,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341017119] [2025-02-08 01:53:46,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:46,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:46,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 01:53:46,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 01:53:46,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:46,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-08 01:53:47,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:47,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341017119] [2025-02-08 01:53:47,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341017119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:47,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:53:47,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:53:47,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708495341] [2025-02-08 01:53:47,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:47,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:53:47,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:47,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:53:47,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:53:47,269 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-08 01:53:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:47,394 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2025-02-08 01:53:47,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:53:47,394 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 81 [2025-02-08 01:53:47,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:47,395 INFO L225 Difference]: With dead ends: 61 [2025-02-08 01:53:47,395 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 01:53:47,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:53:47,396 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 5 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:47,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 270 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:53:47,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 01:53:47,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 01:53:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:53:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 01:53:47,396 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2025-02-08 01:53:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:47,397 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 01:53:47,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-08 01:53:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 01:53:47,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 01:53:47,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 01:53:47,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 01:53:47,402 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:53:47,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 01:53:48,871 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:53:48,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:53:48 BoogieIcfgContainer [2025-02-08 01:53:48,876 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:53:48,876 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:53:48,876 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:53:48,877 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:53:48,877 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:53:08" (3/4) ... [2025-02-08 01:53:48,878 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 01:53:48,883 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2025-02-08 01:53:48,883 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:53:48,883 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-08 01:53:48,883 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 01:53:48,886 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-02-08 01:53:48,887 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 01:53:48,887 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 01:53:48,888 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 01:53:48,943 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:53:48,944 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:53:48,944 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:53:48,945 INFO L158 Benchmark]: Toolchain (without parser) took 42623.83ms. Allocated memory was 201.3MB in the beginning and 536.9MB in the end (delta: 335.5MB). Free memory was 151.1MB in the beginning and 256.0MB in the end (delta: -104.9MB). Peak memory consumption was 228.1MB. Max. memory is 16.1GB. [2025-02-08 01:53:48,945 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 218.1MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:53:48,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1275.70ms. Allocated memory is still 201.3MB. Free memory was 150.6MB in the beginning and 127.2MB in the end (delta: 23.5MB). Peak memory consumption was 119.1MB. Max. memory is 16.1GB. [2025-02-08 01:53:48,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.90ms. Allocated memory is still 201.3MB. Free memory was 127.2MB in the beginning and 121.9MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:53:48,946 INFO L158 Benchmark]: Boogie Preprocessor took 51.93ms. Allocated memory is still 201.3MB. Free memory was 121.9MB in the beginning and 118.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:53:48,946 INFO L158 Benchmark]: IcfgBuilder took 360.29ms. Allocated memory is still 201.3MB. Free memory was 118.8MB in the beginning and 97.7MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 01:53:48,947 INFO L158 Benchmark]: TraceAbstraction took 40769.20ms. Allocated memory was 201.3MB in the beginning and 536.9MB in the end (delta: 335.5MB). Free memory was 97.7MB in the beginning and 264.2MB in the end (delta: -166.4MB). Peak memory consumption was 254.8MB. Max. memory is 16.1GB. [2025-02-08 01:53:48,947 INFO L158 Benchmark]: Witness Printer took 67.30ms. Allocated memory is still 536.9MB. Free memory was 264.2MB in the beginning and 256.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:53:48,948 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 218.1MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1275.70ms. Allocated memory is still 201.3MB. Free memory was 150.6MB in the beginning and 127.2MB in the end (delta: 23.5MB). Peak memory consumption was 119.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.90ms. Allocated memory is still 201.3MB. Free memory was 127.2MB in the beginning and 121.9MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.93ms. Allocated memory is still 201.3MB. Free memory was 121.9MB in the beginning and 118.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 360.29ms. Allocated memory is still 201.3MB. Free memory was 118.8MB in the beginning and 97.7MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 40769.20ms. Allocated memory was 201.3MB in the beginning and 536.9MB in the end (delta: 335.5MB). Free memory was 97.7MB in the beginning and 264.2MB in the end (delta: -166.4MB). Peak memory consumption was 254.8MB. Max. memory is 16.1GB. * Witness Printer took 67.30ms. Allocated memory is still 536.9MB. Free memory was 264.2MB in the beginning and 256.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.3s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 3696 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2973 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2359 IncrementalHoareTripleChecker+Invalid, 2445 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 723 mSDtfsCounter, 2359 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 711 GetRequests, 458 SyntacticMatches, 39 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 26.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=9, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 24 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 33.7s InterpolantComputationTime, 1033 NumberOfCodeBlocks, 1033 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1276 ConstructedInterpolants, 156 QuantifiedInterpolants, 13122 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1271 ConjunctsInSsa, 206 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 750/823 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 01:53:49,153 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-02-08 01:53:49,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE