./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_priority_queue_init_static_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_priority_queue_init_static_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 d7eaf0344f6f57c66c46804220c62b0485b08b4ef0e684c487eaec2203e797bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:55:28,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:55:28,854 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:55:28,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:55:28,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:55:28,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:55:28,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:55:28,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:55:28,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:55:28,872 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:55:28,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:55:28,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:55:28,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:55:28,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:55:28,873 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:55:28,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:55:28,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:55:28,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:55:28,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:55:28,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:55:28,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:55:28,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:55:28,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:55:28,874 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:55:28,874 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:55:28,874 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:55:28,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:55:28,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:55:28,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:55:28,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:55:28,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:55:28,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:55:28,875 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:55:28,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:55:28,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:55:28,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:55:28,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:55:28,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:55:28,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:55:28,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:55:28,875 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 -> d7eaf0344f6f57c66c46804220c62b0485b08b4ef0e684c487eaec2203e797bb [2025-02-08 01:55:29,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:55:29,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:55:29,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:55:29,112 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:55:29,113 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:55:29,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_init_static_harness.i [2025-02-08 01:55:30,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da2532a29/c321601a5fa54756b7db86b3962f1954/FLAGd51468df7 [2025-02-08 01:55:30,605 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:55:30,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_init_static_harness.i [2025-02-08 01:55:30,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da2532a29/c321601a5fa54756b7db86b3962f1954/FLAGd51468df7 [2025-02-08 01:55:30,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da2532a29/c321601a5fa54756b7db86b3962f1954 [2025-02-08 01:55:30,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:55:30,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:55:30,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:55:30,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:55:30,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:55:30,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:55:30" (1/1) ... [2025-02-08 01:55:30,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6399bc50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:55:30, skipping insertion in model container [2025-02-08 01:55:30,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:55:30" (1/1) ... [2025-02-08 01:55:30,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:55:30,919 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_priority_queue_init_static_harness.i[4504,4517] [2025-02-08 01:55:30,927 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_priority_queue_init_static_harness.i[4564,4577] [2025-02-08 01:55:31,437 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,438 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,438 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,439 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,440 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,451 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,451 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,452 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,452 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,757 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,758 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:55:31,827 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:55:31,836 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_priority_queue_init_static_harness.i[4504,4517] [2025-02-08 01:55:31,836 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_priority_queue_init_static_harness.i[4564,4577] [2025-02-08 01:55:31,887 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,891 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,892 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,893 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,893 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,900 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,901 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,902 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,902 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,971 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,975 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:55:31,980 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7703-7714] [2025-02-08 01:55:31,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:55:32,139 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:55:32,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:55:32 WrapperNode [2025-02-08 01:55:32,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:55:32,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:55:32,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:55:32,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:55:32,145 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:55:32" (1/1) ... [2025-02-08 01:55:32,189 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:55:32" (1/1) ... [2025-02-08 01:55:32,232 INFO L138 Inliner]: procedures = 678, calls = 1525, calls flagged for inlining = 53, calls inlined = 9, statements flattened = 683 [2025-02-08 01:55:32,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:55:32,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:55:32,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:55:32,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:55:32,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:55:32" (1/1) ... [2025-02-08 01:55:32,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:55:32" (1/1) ... [2025-02-08 01:55:32,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:55:32" (1/1) ... [2025-02-08 01:55:32,344 INFO L175 MemorySlicer]: Split 296 memory accesses to 5 slices as follows [2, 238, 49, 2, 5]. 80 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 6, 2, 0, 5]. The 252 writes are split as follows [0, 232, 20, 0, 0]. [2025-02-08 01:55:32,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:55:32" (1/1) ... [2025-02-08 01:55:32,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:55:32" (1/1) ... [2025-02-08 01:55:32,373 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:55:32" (1/1) ... [2025-02-08 01:55:32,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:55:32" (1/1) ... [2025-02-08 01:55:32,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:55:32" (1/1) ... [2025-02-08 01:55:32,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:55:32" (1/1) ... [2025-02-08 01:55:32,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:55:32,405 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:55:32,405 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:55:32,405 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:55:32,406 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:55:32" (1/1) ... [2025-02-08 01:55:32,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:55:32,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:55:32,437 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:55:32,441 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:55:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-02-08 01:55:32,460 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-02-08 01:55:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:55:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2025-02-08 01:55:32,461 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2025-02-08 01:55:32,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 01:55:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 01:55:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 01:55:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 01:55:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 01:55:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:55:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:55:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 01:55:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 01:55:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 01:55:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-08 01:55:32,462 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-08 01:55:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:55:32,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:55:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:55:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:55:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:55:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:55:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:55:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 01:55:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 01:55:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:55:32,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:55:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-02-08 01:55:32,464 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-02-08 01:55:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-02-08 01:55:32,464 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-02-08 01:55:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-08 01:55:32,464 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-08 01:55:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-08 01:55:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-08 01:55:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-08 01:55:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-08 01:55:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-08 01:55:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_is_valid [2025-02-08 01:55:32,464 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_is_valid [2025-02-08 01:55:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:55:32,464 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:55:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 01:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 01:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 01:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 01:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-08 01:55:32,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-08 01:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-08 01:55:32,465 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-08 01:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:55:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 01:55:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 01:55:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 01:55:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2025-02-08 01:55:32,466 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2025-02-08 01:55:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2025-02-08 01:55:32,466 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2025-02-08 01:55:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:55:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:55:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:55:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 01:55:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 01:55:32,660 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:55:32,662 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:55:32,701 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc #t~malloc77.base, #t~malloc77.offset; [2025-02-08 01:55:32,703 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-02-08 01:55:32,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc #t~ret57#1; [2025-02-08 01:55:32,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-08 01:55:32,761 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7341: havoc #t~ret656.base, #t~ret656.offset; [2025-02-08 01:55:32,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7494: havoc aws_priority_queue_backpointers_valid_#t~ret686#1;havoc aws_priority_queue_backpointers_valid_#t~short687#1; [2025-02-08 01:55:32,894 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268: call ULTIMATE.dealloc(~#required_size~0.base, ~#required_size~0.offset);havoc ~#required_size~0.base, ~#required_size~0.offset; [2025-02-08 01:55:38,328 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-02-08 01:55:38,329 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:55:38,339 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:55:38,340 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:55:38,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:55:38 BoogieIcfgContainer [2025-02-08 01:55:38,340 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:55:38,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:55:38,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:55:38,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:55:38,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:55:30" (1/3) ... [2025-02-08 01:55:38,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9239f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:55:38, skipping insertion in model container [2025-02-08 01:55:38,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:55:32" (2/3) ... [2025-02-08 01:55:38,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9239f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:55:38, skipping insertion in model container [2025-02-08 01:55:38,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:55:38" (3/3) ... [2025-02-08 01:55:38,347 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_init_static_harness.i [2025-02-08 01:55:38,358 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:55:38,359 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_priority_queue_init_static_harness.i that has 14 procedures, 160 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-08 01:55:38,409 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:55:38,418 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;@580f985, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:55:38,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:55:38,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 98 states have internal predecessors, (118), 48 states have call successors, (48), 13 states have call predecessors, (48), 13 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-08 01:55:38,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-08 01:55:38,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:38,438 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:38,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:38,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:38,443 INFO L85 PathProgramCache]: Analyzing trace with hash -302543851, now seen corresponding path program 1 times [2025-02-08 01:55:38,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:38,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070822952] [2025-02-08 01:55:38,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:38,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:42,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 01:55:43,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 01:55:43,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:43,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2025-02-08 01:55:43,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070822952] [2025-02-08 01:55:43,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070822952] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:55:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38578133] [2025-02-08 01:55:43,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:43,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:55:43,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:55:43,723 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:55:43,724 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:55:47,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 01:55:48,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 01:55:48,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:48,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:48,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 4467 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:55:48,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:55:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2025-02-08 01:55:48,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:55:48,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38578133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:48,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:55:48,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:55:48,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332003848] [2025-02-08 01:55:48,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:48,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:55:48,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:48,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:55:48,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:55:48,318 INFO L87 Difference]: Start difference. First operand has 160 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 98 states have internal predecessors, (118), 48 states have call successors, (48), 13 states have call predecessors, (48), 13 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-08 01:55:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:48,357 INFO L93 Difference]: Finished difference Result 297 states and 423 transitions. [2025-02-08 01:55:48,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:55:48,359 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 152 [2025-02-08 01:55:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:48,365 INFO L225 Difference]: With dead ends: 297 [2025-02-08 01:55:48,365 INFO L226 Difference]: Without dead ends: 150 [2025-02-08 01:55:48,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 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:55:48,372 INFO L435 NwaCegarLoop]: 210 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, 210 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:55:48,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:55:48,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-02-08 01:55:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-02-08 01:55:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 90 states have (on average 1.1777777777777778) internal successors, (106), 91 states have internal predecessors, (106), 47 states have call successors, (47), 12 states have call predecessors, (47), 12 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-08 01:55:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 199 transitions. [2025-02-08 01:55:48,408 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 199 transitions. Word has length 152 [2025-02-08 01:55:48,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:48,409 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 199 transitions. [2025-02-08 01:55:48,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-08 01:55:48,410 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 199 transitions. [2025-02-08 01:55:48,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-08 01:55:48,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:48,412 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:48,426 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:55:48,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 01:55:48,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:48,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:48,614 INFO L85 PathProgramCache]: Analyzing trace with hash 117011950, now seen corresponding path program 1 times [2025-02-08 01:55:48,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:48,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986112599] [2025-02-08 01:55:48,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:48,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:52,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 01:55:52,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 01:55:52,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:52,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-08 01:55:54,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:54,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986112599] [2025-02-08 01:55:54,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986112599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:54,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:55:54,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:55:54,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836516539] [2025-02-08 01:55:54,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:54,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:55:54,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:54,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:55:54,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:55:54,294 INFO L87 Difference]: Start difference. First operand 150 states and 199 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (30), 5 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-08 01:55:55,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:55,780 INFO L93 Difference]: Finished difference Result 235 states and 308 transitions. [2025-02-08 01:55:55,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:55:55,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (30), 5 states have call predecessors, (30), 4 states have call successors, (30) Word has length 170 [2025-02-08 01:55:55,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:55,784 INFO L225 Difference]: With dead ends: 235 [2025-02-08 01:55:55,784 INFO L226 Difference]: Without dead ends: 152 [2025-02-08 01:55:55,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:55:55,785 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 34 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:55,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 945 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 01:55:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-08 01:55:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-02-08 01:55:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 93 states have internal predecessors, (107), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2025-02-08 01:55:55,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 202 transitions. [2025-02-08 01:55:55,801 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 202 transitions. Word has length 170 [2025-02-08 01:55:55,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:55,801 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 202 transitions. [2025-02-08 01:55:55,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (30), 5 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-08 01:55:55,801 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 202 transitions. [2025-02-08 01:55:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-08 01:55:55,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:55,803 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 9, 9, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:55,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:55:55,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:55,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:55,804 INFO L85 PathProgramCache]: Analyzing trace with hash -916256217, now seen corresponding path program 1 times [2025-02-08 01:55:55,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:55,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78770811] [2025-02-08 01:55:55,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:55,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:59,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-08 01:55:59,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-08 01:55:59,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:59,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:56:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-08 01:56:01,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:56:01,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78770811] [2025-02-08 01:56:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78770811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:56:01,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:56:01,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:56:01,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994104681] [2025-02-08 01:56:01,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:56:01,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:56:01,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:56:01,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:56:01,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:56:01,367 INFO L87 Difference]: Start difference. First operand 152 states and 202 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2025-02-08 01:56:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:56:01,808 INFO L93 Difference]: Finished difference Result 256 states and 336 transitions. [2025-02-08 01:56:01,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:56:01,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) Word has length 184 [2025-02-08 01:56:01,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:56:01,813 INFO L225 Difference]: With dead ends: 256 [2025-02-08 01:56:01,814 INFO L226 Difference]: Without dead ends: 152 [2025-02-08 01:56:01,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:56:01,815 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 6 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 01:56:01,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 953 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 01:56:01,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-08 01:56:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-02-08 01:56:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 91 states have (on average 1.164835164835165) internal successors, (106), 93 states have internal predecessors, (106), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2025-02-08 01:56:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 201 transitions. [2025-02-08 01:56:01,834 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 201 transitions. Word has length 184 [2025-02-08 01:56:01,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:56:01,835 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 201 transitions. [2025-02-08 01:56:01,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2025-02-08 01:56:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 201 transitions. [2025-02-08 01:56:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-08 01:56:01,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:56:01,838 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 9, 9, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:01,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:56:01,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:56:01,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:56:01,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1515795211, now seen corresponding path program 1 times [2025-02-08 01:56:01,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:56:01,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345642498] [2025-02-08 01:56:01,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:56:01,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:56:05,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 01:56:06,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 01:56:06,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:56:06,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:56:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-08 01:56:08,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:56:08,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345642498] [2025-02-08 01:56:08,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345642498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:56:08,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:56:08,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:56:08,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717908056] [2025-02-08 01:56:08,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:56:08,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:56:08,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:56:08,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:56:08,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:56:08,636 INFO L87 Difference]: Start difference. First operand 152 states and 201 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2025-02-08 01:56:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:56:09,056 INFO L93 Difference]: Finished difference Result 257 states and 337 transitions. [2025-02-08 01:56:09,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:56:09,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) Word has length 185 [2025-02-08 01:56:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:56:09,060 INFO L225 Difference]: With dead ends: 257 [2025-02-08 01:56:09,060 INFO L226 Difference]: Without dead ends: 153 [2025-02-08 01:56:09,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:56:09,062 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 6 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 01:56:09,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 953 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 01:56:09,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-08 01:56:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-08 01:56:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 94 states have internal predecessors, (107), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2025-02-08 01:56:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 202 transitions. [2025-02-08 01:56:09,080 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 202 transitions. Word has length 185 [2025-02-08 01:56:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:56:09,081 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 202 transitions. [2025-02-08 01:56:09,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2025-02-08 01:56:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 202 transitions. [2025-02-08 01:56:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-08 01:56:09,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:56:09,082 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 9, 9, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:09,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:56:09,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:56:09,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:56:09,083 INFO L85 PathProgramCache]: Analyzing trace with hash 405981801, now seen corresponding path program 1 times [2025-02-08 01:56:09,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:56:09,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983200980] [2025-02-08 01:56:09,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:56:09,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:56:12,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 01:56:13,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 01:56:13,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:56:13,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:56:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-08 01:56:15,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:56:15,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983200980] [2025-02-08 01:56:15,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983200980] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:56:15,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745182446] [2025-02-08 01:56:15,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:56:15,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:56:15,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:56:15,744 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:56:15,745 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:56:19,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 01:56:20,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 01:56:20,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:56:20,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:56:20,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 4695 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-02-08 01:56:20,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:56:20,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 01:56:25,571 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 01:56:25,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-08 01:56:29,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 01:56:30,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:56:30,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 01:56:42,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 01:56:43,327 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 18 treesize of output 10 [2025-02-08 01:56:43,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 01:56:44,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 01:56:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2025-02-08 01:56:48,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:56:50,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745182446] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:56:50,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:56:50,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 23] total 30 [2025-02-08 01:56:50,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057695557] [2025-02-08 01:56:50,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 01:56:50,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-08 01:56:50,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:56:50,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-08 01:56:50,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2025-02-08 01:56:50,189 INFO L87 Difference]: Start difference. First operand 153 states and 202 transitions. Second operand has 30 states, 26 states have (on average 4.346153846153846) internal successors, (113), 27 states have internal predecessors, (113), 15 states have call successors, (64), 7 states have call predecessors, (64), 8 states have return successors, (63), 14 states have call predecessors, (63), 15 states have call successors, (63) [2025-02-08 01:56:54,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:56:58,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []