./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_priority_queue_capacity_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_priority_queue_capacity_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3d929c4e9006747fc293836abf67036a0361374cf7a5424bbaba854150966272 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:00:58,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:00:58,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:00:58,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:00:58,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:00:58,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:00:58,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:00:58,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:00:58,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:00:58,868 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:00:58,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:00:58,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:00:58,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:00:58,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:00:58,868 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:00:58,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:00:58,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:00:58,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:00:58,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:00:58,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:00:58,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:00:58,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:00:58,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:00:58,871 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:00:58,871 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:00:58,871 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:00:58,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:00:58,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:00:58,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:00:58,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:00:58,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:00:58,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:00:58,872 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:00:58,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:00:58,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:00:58,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:00:58,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:00:58,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:00:58,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:00:58,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:00:58,872 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3d929c4e9006747fc293836abf67036a0361374cf7a5424bbaba854150966272 [2025-03-04 03:00:59,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:00:59,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:00:59,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:00:59,113 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:00:59,114 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:00:59,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_capacity_harness.i [2025-03-04 03:01:00,248 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/698f804b1/37163bc13e794db8be02fd7bfc1199bf/FLAGfcc6b160b [2025-03-04 03:01:00,715 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:01:00,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_capacity_harness.i [2025-03-04 03:01:00,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/698f804b1/37163bc13e794db8be02fd7bfc1199bf/FLAGfcc6b160b [2025-03-04 03:01:00,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/698f804b1/37163bc13e794db8be02fd7bfc1199bf [2025-03-04 03:01:00,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:01:00,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:01:00,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:01:00,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:01:00,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:01:00,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:01:00" (1/1) ... [2025-03-04 03:01:00,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d5b523a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:00, skipping insertion in model container [2025-03-04 03:01:00,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:01:00" (1/1) ... [2025-03-04 03:01:00,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:01:01,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_capacity_harness.i[4501,4514] [2025-03-04 03:01:01,105 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_capacity_harness.i[4561,4574] [2025-03-04 03:01:01,602 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:01,602 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:01,603 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:01,603 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:01,604 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:01,611 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:01,615 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:01,617 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:01,617 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:01,916 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:01,917 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:01,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:01:01,979 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:01:01,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_capacity_harness.i[4501,4514] [2025-03-04 03:01:01,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_capacity_harness.i[4561,4574] [2025-03-04 03:01:02,029 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:02,030 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:02,030 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:02,030 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:02,031 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:02,035 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:02,035 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:02,036 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:02,036 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:02,123 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:02,123 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:02,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7703-7714] [2025-03-04 03:01:02,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:01:02,288 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:01:02,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:02 WrapperNode [2025-03-04 03:01:02,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:01:02,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:01:02,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:01:02,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:01:02,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:02" (1/1) ... [2025-03-04 03:01:02,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:02" (1/1) ... [2025-03-04 03:01:02,375 INFO L138 Inliner]: procedures = 678, calls = 1548, calls flagged for inlining = 54, calls inlined = 10, statements flattened = 698 [2025-03-04 03:01:02,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:01:02,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:01:02,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:01:02,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:01:02,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:02" (1/1) ... [2025-03-04 03:01:02,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:02" (1/1) ... [2025-03-04 03:01:02,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:02" (1/1) ... [2025-03-04 03:01:02,449 INFO L175 MemorySlicer]: Split 338 memory accesses to 6 slices as follows [238, 2, 82, 3, 7, 6]. 70 percent of accesses are in the largest equivalence class. The 24 initializations are split as follows [6, 2, 10, 1, 5, 0]. The 252 writes are split as follows [232, 0, 17, 1, 0, 2]. [2025-03-04 03:01:02,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:02" (1/1) ... [2025-03-04 03:01:02,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:02" (1/1) ... [2025-03-04 03:01:02,475 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:02" (1/1) ... [2025-03-04 03:01:02,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:02" (1/1) ... [2025-03-04 03:01:02,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:02" (1/1) ... [2025-03-04 03:01:02,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:02" (1/1) ... [2025-03-04 03:01:02,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:01:02,502 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:01:02,502 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:01:02,502 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:01:02,503 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:02" (1/1) ... [2025-03-04 03:01:02,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:01:02,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:01:02,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 03:01:02,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 03:01:02,548 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-03-04 03:01:02,549 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-03-04 03:01:02,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:01:02,549 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2025-03-04 03:01:02,549 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2025-03-04 03:01:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2025-03-04 03:01:02,550 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2025-03-04 03:01:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-04 03:01:02,550 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-04 03:01:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:01:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:01:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:01:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:01:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:01:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 03:01:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:01:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:01:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:01:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:01:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:01:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 03:01:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 03:01:02,552 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 03:01:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 03:01:02,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 03:01:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:01:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:01:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2025-03-04 03:01:02,553 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2025-03-04 03:01:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:01:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:01:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:01:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:01:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:01:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 03:01:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:01:02,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:01:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 03:01:02,553 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 03:01:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2025-03-04 03:01:02,553 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2025-03-04 03:01:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-03-04 03:01:02,553 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-03-04 03:01:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 03:01:02,554 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 03:01:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:01:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:01:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:01:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:01:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:01:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 03:01:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_is_valid [2025-03-04 03:01:02,554 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_is_valid [2025-03-04 03:01:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 03:01:02,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 03:01:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:01:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:01:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:01:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:01:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:01:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-04 03:01:02,555 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 03:01:02,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure assert_array_list_equivalence [2025-03-04 03:01:02,555 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_array_list_equivalence [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2025-03-04 03:01:02,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:01:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 03:01:02,792 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:01:02,795 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:01:02,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc #t~malloc77.base, #t~malloc77.offset; [2025-03-04 03:01:02,873 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-03-04 03:01:02,891 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc #t~ret57#1; [2025-03-04 03:01:03,015 INFO L1325 $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-03-04 03:01:03,066 INFO L1325 $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-03-04 03:01:03,069 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-04 03:01:08,058 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7538: havoc aws_priority_queue_capacity_#t~ret696#1; [2025-03-04 03:01:08,104 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2025-03-04 03:01:08,104 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:01:08,116 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:01:08,116 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 03:01:08,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:01:08 BoogieIcfgContainer [2025-03-04 03:01:08,116 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:01:08,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:01:08,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:01:08,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:01:08,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:01:00" (1/3) ... [2025-03-04 03:01:08,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63bcf7fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:01:08, skipping insertion in model container [2025-03-04 03:01:08,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:02" (2/3) ... [2025-03-04 03:01:08,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63bcf7fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:01:08, skipping insertion in model container [2025-03-04 03:01:08,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:01:08" (3/3) ... [2025-03-04 03:01:08,128 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_capacity_harness.i [2025-03-04 03:01:08,142 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:01:08,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_priority_queue_capacity_harness.i that has 18 procedures, 184 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 03:01:08,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:01:08,216 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;@c72c8ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:01:08,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:01:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 119 states have internal predecessors, (142), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 03:01:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 03:01:08,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:01:08,235 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:01:08,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:01:08,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:01:08,241 INFO L85 PathProgramCache]: Analyzing trace with hash 671236619, now seen corresponding path program 1 times [2025-03-04 03:01:08,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:01:08,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411353475] [2025-03-04 03:01:08,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:08,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:01:12,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 03:01:12,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 03:01:12,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:12,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-04 03:01:13,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:01:13,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411353475] [2025-03-04 03:01:13,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411353475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:01:13,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922334337] [2025-03-04 03:01:13,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:13,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:01:13,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:01:13,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:01:13,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 03:01:17,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 03:01:17,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 03:01:17,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:17,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:17,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 4508 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 03:01:17,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:01:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-04 03:01:17,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:01:17,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922334337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:01:17,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:01:17,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 03:01:17,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517037416] [2025-03-04 03:01:17,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:01:17,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 03:01:17,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:01:17,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 03:01:17,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 03:01:17,967 INFO L87 Difference]: Start difference. First operand has 184 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 119 states have internal predecessors, (142), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 03:01:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:01:18,000 INFO L93 Difference]: Finished difference Result 345 states and 466 transitions. [2025-03-04 03:01:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 03:01:18,002 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2025-03-04 03:01:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:01:18,010 INFO L225 Difference]: With dead ends: 345 [2025-03-04 03:01:18,011 INFO L226 Difference]: Without dead ends: 179 [2025-03-04 03:01:18,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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-03-04 03:01:18,016 INFO L435 NwaCegarLoop]: 234 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, 234 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-03-04 03:01:18,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:01:18,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-04 03:01:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-03-04 03:01:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 115 states have internal predecessors, (136), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 03:01:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 229 transitions. [2025-03-04 03:01:18,060 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 229 transitions. Word has length 140 [2025-03-04 03:01:18,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:01:18,062 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 229 transitions. [2025-03-04 03:01:18,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 03:01:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 229 transitions. [2025-03-04 03:01:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 03:01:18,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:01:18,069 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:01:18,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 03:01:18,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 03:01:18,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:01:18,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:01:18,271 INFO L85 PathProgramCache]: Analyzing trace with hash -799582070, now seen corresponding path program 1 times [2025-03-04 03:01:18,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:01:18,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814085856] [2025-03-04 03:01:18,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:18,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:01:21,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 03:01:22,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 03:01:22,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:22,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-04 03:01:23,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:01:23,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814085856] [2025-03-04 03:01:23,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814085856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:01:23,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:01:23,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:01:23,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603533958] [2025-03-04 03:01:23,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:01:23,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:01:23,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:01:23,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:01:23,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:01:23,052 INFO L87 Difference]: Start difference. First operand 179 states and 229 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 03:01:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:01:23,641 INFO L93 Difference]: Finished difference Result 304 states and 389 transitions. [2025-03-04 03:01:23,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:01:23,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 140 [2025-03-04 03:01:23,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:01:23,644 INFO L225 Difference]: With dead ends: 304 [2025-03-04 03:01:23,644 INFO L226 Difference]: Without dead ends: 179 [2025-03-04 03:01:23,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:01:23,645 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 12 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 03:01:23,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 811 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 03:01:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-04 03:01:23,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-03-04 03:01:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 115 states have internal predecessors, (135), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 03:01:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 228 transitions. [2025-03-04 03:01:23,658 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 228 transitions. Word has length 140 [2025-03-04 03:01:23,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:01:23,659 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 228 transitions. [2025-03-04 03:01:23,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 03:01:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 228 transitions. [2025-03-04 03:01:23,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 03:01:23,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:01:23,661 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:01:23,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:01:23,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:01:23,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:01:23,661 INFO L85 PathProgramCache]: Analyzing trace with hash 151945090, now seen corresponding path program 1 times [2025-03-04 03:01:23,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:01:23,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740958674] [2025-03-04 03:01:23,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:23,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:01:27,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 03:01:27,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 03:01:27,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:27,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-04 03:01:28,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:01:28,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740958674] [2025-03-04 03:01:28,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740958674] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:01:28,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748277940] [2025-03-04 03:01:28,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:28,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:01:28,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:01:28,784 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:01:28,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 03:01:32,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 03:01:33,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 03:01:33,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:33,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:33,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 4558 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 03:01:33,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:01:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 03:01:35,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:01:35,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748277940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:01:35,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:01:35,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-03-04 03:01:35,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979145053] [2025-03-04 03:01:35,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:01:35,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 03:01:35,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:01:35,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 03:01:35,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 03:01:35,274 INFO L87 Difference]: Start difference. First operand 179 states and 228 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-04 03:01:39,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:01:39,425 INFO L93 Difference]: Finished difference Result 323 states and 418 transitions. [2025-03-04 03:01:39,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 03:01:39,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 148 [2025-03-04 03:01:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:01:39,428 INFO L225 Difference]: With dead ends: 323 [2025-03-04 03:01:39,428 INFO L226 Difference]: Without dead ends: 181 [2025-03-04 03:01:39,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-04 03:01:39,429 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 261 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:01:39,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1035 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-04 03:01:39,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-04 03:01:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-04 03:01:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 115 states have (on average 1.182608695652174) internal successors, (136), 117 states have internal predecessors, (136), 47 states have call successors, (47), 17 states have call predecessors, (47), 18 states have return successors, (49), 46 states have call predecessors, (49), 46 states have call successors, (49) [2025-03-04 03:01:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 232 transitions. [2025-03-04 03:01:39,440 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 232 transitions. Word has length 148 [2025-03-04 03:01:39,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:01:39,441 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 232 transitions. [2025-03-04 03:01:39,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-04 03:01:39,441 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 232 transitions. [2025-03-04 03:01:39,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 03:01:39,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:01:39,444 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:01:39,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 03:01:39,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 03:01:39,645 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:01:39,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:01:39,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2056521705, now seen corresponding path program 1 times [2025-03-04 03:01:39,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:01:39,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534810556] [2025-03-04 03:01:39,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:39,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:01:43,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 03:01:43,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 03:01:43,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:43,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-03-04 03:01:44,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:01:44,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534810556] [2025-03-04 03:01:44,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534810556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:01:44,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:01:44,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:01:44,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021816858] [2025-03-04 03:01:44,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:01:44,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:01:44,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:01:44,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:01:44,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:01:44,616 INFO L87 Difference]: Start difference. First operand 181 states and 232 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2025-03-04 03:01:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:01:45,885 INFO L93 Difference]: Finished difference Result 309 states and 396 transitions. [2025-03-04 03:01:45,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:01:45,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 163 [2025-03-04 03:01:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:01:45,891 INFO L225 Difference]: With dead ends: 309 [2025-03-04 03:01:45,891 INFO L226 Difference]: Without dead ends: 181 [2025-03-04 03:01:45,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:01:45,893 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 29 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:01:45,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 970 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 03:01:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-04 03:01:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-04 03:01:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 115 states have (on average 1.173913043478261) internal successors, (135), 117 states have internal predecessors, (135), 47 states have call successors, (47), 17 states have call predecessors, (47), 18 states have return successors, (49), 46 states have call predecessors, (49), 46 states have call successors, (49) [2025-03-04 03:01:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 231 transitions. [2025-03-04 03:01:45,911 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 231 transitions. Word has length 163 [2025-03-04 03:01:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:01:45,911 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 231 transitions. [2025-03-04 03:01:45,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2025-03-04 03:01:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 231 transitions. [2025-03-04 03:01:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-04 03:01:45,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:01:45,914 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:01:45,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:01:45,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:01:45,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:01:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1184350268, now seen corresponding path program 1 times [2025-03-04 03:01:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:01:45,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747031954] [2025-03-04 03:01:45,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:45,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:01:49,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 03:01:49,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 03:01:49,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:49,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-03-04 03:01:51,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:01:51,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747031954] [2025-03-04 03:01:51,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747031954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:01:51,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760880472] [2025-03-04 03:01:51,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:51,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:01:51,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:01:51,180 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:01:51,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 03:01:55,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 03:01:55,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 03:01:55,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:55,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:55,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 4752 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 03:01:55,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:01:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-04 03:01:58,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:01:58,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760880472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:01:58,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:01:58,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-03-04 03:01:58,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142511687] [2025-03-04 03:01:58,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:01:58,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 03:01:58,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:01:58,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 03:01:58,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-04 03:01:58,157 INFO L87 Difference]: Start difference. First operand 181 states and 231 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 5 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-03-04 03:02:03,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:02:03,387 INFO L93 Difference]: Finished difference Result 322 states and 413 transitions. [2025-03-04 03:02:03,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 03:02:03,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 5 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 179 [2025-03-04 03:02:03,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:02:03,390 INFO L225 Difference]: With dead ends: 322 [2025-03-04 03:02:03,391 INFO L226 Difference]: Without dead ends: 181 [2025-03-04 03:02:03,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-03-04 03:02:03,392 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 278 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:02:03,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1135 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-04 03:02:03,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-04 03:02:03,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-04 03:02:03,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 115 states have (on average 1.173913043478261) internal successors, (135), 117 states have internal predecessors, (135), 47 states have call successors, (47), 17 states have call predecessors, (47), 18 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2025-03-04 03:02:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 230 transitions. [2025-03-04 03:02:03,407 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 230 transitions. Word has length 179 [2025-03-04 03:02:03,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:02:03,407 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 230 transitions. [2025-03-04 03:02:03,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 5 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-03-04 03:02:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 230 transitions. [2025-03-04 03:02:03,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-04 03:02:03,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:02:03,409 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:02:03,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 03:02:03,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:02:03,610 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:02:03,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:02:03,610 INFO L85 PathProgramCache]: Analyzing trace with hash -138128071, now seen corresponding path program 2 times [2025-03-04 03:02:03,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:02:03,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082844151] [2025-03-04 03:02:03,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:02:03,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:02:07,317 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 194 statements into 2 equivalence classes. [2025-03-04 03:02:07,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 03:02:07,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 03:02:07,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:02:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-04 03:02:09,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:02:09,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082844151] [2025-03-04 03:02:09,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082844151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:02:09,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:02:09,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:02:09,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339507781] [2025-03-04 03:02:09,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:02:09,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:02:09,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:02:09,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:02:09,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:02:09,201 INFO L87 Difference]: Start difference. First operand 181 states and 230 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 4 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-04 03:02:10,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:02:10,316 INFO L93 Difference]: Finished difference Result 284 states and 358 transitions. [2025-03-04 03:02:10,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:02:10,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 4 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) Word has length 194 [2025-03-04 03:02:10,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:02:10,318 INFO L225 Difference]: With dead ends: 284 [2025-03-04 03:02:10,318 INFO L226 Difference]: Without dead ends: 179 [2025-03-04 03:02:10,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-03-04 03:02:10,319 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 19 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:02:10,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 974 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 03:02:10,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-04 03:02:10,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-03-04 03:02:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 115 states have internal predecessors, (133), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 03:02:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 226 transitions. [2025-03-04 03:02:10,333 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 226 transitions. Word has length 194 [2025-03-04 03:02:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:02:10,333 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 226 transitions. [2025-03-04 03:02:10,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 4 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-04 03:02:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 226 transitions. [2025-03-04 03:02:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-04 03:02:10,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:02:10,336 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:02:10,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 03:02:10,336 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:02:10,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:02:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash -693071289, now seen corresponding path program 1 times [2025-03-04 03:02:10,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:02:10,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506585341] [2025-03-04 03:02:10,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:02:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:02:13,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-04 03:02:18,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-04 03:02:18,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:02:18,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:02:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-03-04 03:02:21,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:02:21,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506585341] [2025-03-04 03:02:21,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506585341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:02:21,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:02:21,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:02:21,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45312649] [2025-03-04 03:02:21,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:02:21,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:02:21,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:02:21,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:02:21,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:02:21,217 INFO L87 Difference]: Start difference. First operand 179 states and 226 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 03:02:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:02:22,514 INFO L93 Difference]: Finished difference Result 313 states and 397 transitions. [2025-03-04 03:02:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:02:22,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 224 [2025-03-04 03:02:22,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:02:22,517 INFO L225 Difference]: With dead ends: 313 [2025-03-04 03:02:22,517 INFO L226 Difference]: Without dead ends: 190 [2025-03-04 03:02:22,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:02:22,518 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 22 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:02:22,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 802 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 03:02:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-04 03:02:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 181. [2025-03-04 03:02:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 116 states have (on average 1.1637931034482758) internal successors, (135), 117 states have internal predecessors, (135), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 03:02:22,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 228 transitions. [2025-03-04 03:02:22,535 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 228 transitions. Word has length 224 [2025-03-04 03:02:22,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:02:22,535 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 228 transitions. [2025-03-04 03:02:22,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 03:02:22,535 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 228 transitions. [2025-03-04 03:02:22,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-04 03:02:22,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:02:22,539 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:02:22,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 03:02:22,540 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:02:22,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:02:22,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1078438072, now seen corresponding path program 1 times [2025-03-04 03:02:22,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:02:22,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146699093] [2025-03-04 03:02:22,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:02:22,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:02:26,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes.