./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_priority_queue_size_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_size_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 717a04d93cdb05e0e1badb8a5b5a815e5ffe711ba3ffceb407a0dd65280ab4bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:04:15,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:04:15,845 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:04:15,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:04:15,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:04:15,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:04:15,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:04:15,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:04:15,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:04:15,869 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:04:15,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:04:15,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:04:15,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:04:15,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:04:15,871 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:04:15,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:04:15,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:04:15,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:04:15,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:04:15,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:04:15,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:04:15,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:04:15,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:04:15,872 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:04:15,872 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:04:15,872 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:04:15,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:04:15,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:04:15,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:04:15,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:04:15,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:04:15,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:04:15,873 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:04:15,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:04:15,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:04:15,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:04:15,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:04:15,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:04:15,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:04:15,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:04:15,873 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 -> 717a04d93cdb05e0e1badb8a5b5a815e5ffe711ba3ffceb407a0dd65280ab4bb [2025-03-04 03:04:16,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:04:16,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:04:16,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:04:16,098 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:04:16,099 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:04:16,100 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_size_harness.i [2025-03-04 03:04:17,315 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2c91dbb/7c1aa5eb91a34b05aef049fa21c28633/FLAGeec670eb8 [2025-03-04 03:04:17,804 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:04:17,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i [2025-03-04 03:04:17,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2c91dbb/7c1aa5eb91a34b05aef049fa21c28633/FLAGeec670eb8 [2025-03-04 03:04:17,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2c91dbb/7c1aa5eb91a34b05aef049fa21c28633 [2025-03-04 03:04:17,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:04:17,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:04:17,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:04:17,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:04:17,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:04:17,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:04:17" (1/1) ... [2025-03-04 03:04:17,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b7e090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:17, skipping insertion in model container [2025-03-04 03:04:17,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:04:17" (1/1) ... [2025-03-04 03:04:17,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:04:18,126 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_size_harness.i[4497,4510] [2025-03-04 03:04:18,133 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_size_harness.i[4557,4570] [2025-03-04 03:04:18,588 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:18,593 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:18,593 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:18,593 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:18,594 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:18,606 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:18,608 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:18,609 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:18,609 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:18,903 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:18,903 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:18,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:04:18,974 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:04:18,987 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_size_harness.i[4497,4510] [2025-03-04 03:04:18,992 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_size_harness.i[4557,4570] [2025-03-04 03:04:19,047 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:19,048 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:19,048 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:19,048 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:19,049 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:19,058 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:19,058 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:19,059 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:19,060 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:19,152 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:19,152 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:04:19,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7703-7714] [2025-03-04 03:04:19,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:04:19,338 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:04:19,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:19 WrapperNode [2025-03-04 03:04:19,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:04:19,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:04:19,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:04:19,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:04:19,345 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:04:19" (1/1) ... [2025-03-04 03:04:19,386 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:04:19" (1/1) ... [2025-03-04 03:04:19,429 INFO L138 Inliner]: procedures = 678, calls = 1543, calls flagged for inlining = 54, calls inlined = 9, statements flattened = 673 [2025-03-04 03:04:19,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:04:19,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:04:19,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:04:19,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:04:19,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:19" (1/1) ... [2025-03-04 03:04:19,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:19" (1/1) ... [2025-03-04 03:04:19,448 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:19" (1/1) ... [2025-03-04 03:04:19,510 INFO L175 MemorySlicer]: Split 335 memory accesses to 6 slices as follows [238, 2, 3, 79, 6, 7]. 71 percent of accesses are in the largest equivalence class. The 24 initializations are split as follows [6, 2, 1, 10, 0, 5]. The 252 writes are split as follows [232, 0, 1, 17, 2, 0]. [2025-03-04 03:04:19,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:19" (1/1) ... [2025-03-04 03:04:19,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:19" (1/1) ... [2025-03-04 03:04:19,543 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:19" (1/1) ... [2025-03-04 03:04:19,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:19" (1/1) ... [2025-03-04 03:04:19,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:19" (1/1) ... [2025-03-04 03:04:19,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:19" (1/1) ... [2025-03-04 03:04:19,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:04:19,580 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:04:19,580 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:04:19,580 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:04:19,581 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:19" (1/1) ... [2025-03-04 03:04:19,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:04:19,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:04:19,605 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:04:19,608 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:04:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-03-04 03:04:19,626 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-03-04 03:04:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:04:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2025-03-04 03:04:19,626 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2025-03-04 03:04:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2025-03-04 03:04:19,626 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2025-03-04 03:04:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-04 03:04:19,627 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-04 03:04:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:04:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:04:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:04:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:04:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:04:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 03:04:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:04:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:04:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:04:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:04:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:04:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 03:04:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 03:04:19,627 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 03:04:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 03:04:19,628 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 03:04:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:04:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:04:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2025-03-04 03:04:19,628 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2025-03-04 03:04:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:04:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:04:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:04:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:04:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:04:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 03:04:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:04:19,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:04:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 03:04:19,629 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 03:04:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2025-03-04 03:04:19,629 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2025-03-04 03:04:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-03-04 03:04:19,629 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-03-04 03:04:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 03:04:19,629 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 03:04:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:04:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:04:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:04:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:04:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:04:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 03:04:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_is_valid [2025-03-04 03:04:19,629 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_is_valid [2025-03-04 03:04:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_length [2025-03-04 03:04:19,629 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_length [2025-03-04 03:04:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 03:04:19,630 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 03:04:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:04:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:04:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:04:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:04:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:04:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:04:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 03:04:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 03:04:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 03:04:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 03:04:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 03:04:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 03:04:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 03:04:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-04 03:04:19,633 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-04 03:04:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 03:04:19,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 03:04:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:04:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:04:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:04:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:04:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:04:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 03:04:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure assert_array_list_equivalence [2025-03-04 03:04:19,634 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_array_list_equivalence [2025-03-04 03:04:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2025-03-04 03:04:19,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2025-03-04 03:04:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:04:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:04:19,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:04:19,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:04:19,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:04:19,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 03:04:19,909 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:04:19,911 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:04:19,946 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc #t~malloc77.base, #t~malloc77.offset; [2025-03-04 03:04:20,002 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-03-04 03:04:20,022 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc #t~ret57#1; [2025-03-04 03:04:20,122 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:04:20,173 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:04:20,176 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-04 03:04:25,570 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7534: havoc aws_priority_queue_size_#t~ret695#1; [2025-03-04 03:04:25,639 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2025-03-04 03:04:25,640 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:04:25,650 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:04:25,650 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 03:04:25,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:04:25 BoogieIcfgContainer [2025-03-04 03:04:25,650 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:04:25,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:04:25,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:04:25,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:04:25,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:04:17" (1/3) ... [2025-03-04 03:04:25,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796533be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:04:25, skipping insertion in model container [2025-03-04 03:04:25,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:19" (2/3) ... [2025-03-04 03:04:25,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796533be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:04:25, skipping insertion in model container [2025-03-04 03:04:25,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:04:25" (3/3) ... [2025-03-04 03:04:25,659 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_size_harness.i [2025-03-04 03:04:25,670 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:04:25,672 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_priority_queue_size_harness.i that has 19 procedures, 185 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 03:04:25,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:04:25,725 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;@2e97f163, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:04:25,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:04:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 185 states, 119 states have (on average 1.2100840336134453) internal successors, (144), 120 states have internal predecessors, (144), 46 states have call successors, (46), 18 states have call predecessors, (46), 18 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 03:04:25,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 03:04:25,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:04:25,739 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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:04:25,740 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:04:25,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:04:25,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1666906181, now seen corresponding path program 1 times [2025-03-04 03:04:25,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:04:25,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746306439] [2025-03-04 03:04:25,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:04:25,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:04:30,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 03:04:30,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 03:04:30,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:04:30,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:04:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-04 03:04:31,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:04:31,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746306439] [2025-03-04 03:04:31,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746306439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:04:31,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110887839] [2025-03-04 03:04:31,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:04:31,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:04:31,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:04:31,172 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:04:31,174 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:04:35,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 03:04:36,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 03:04:36,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:04:36,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:04:36,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 4520 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 03:04:36,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:04:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-04 03:04:36,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:04:36,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110887839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:04:36,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:04:36,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 03:04:36,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643720030] [2025-03-04 03:04:36,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:04:36,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 03:04:36,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:04:36,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 03:04:36,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 03:04:36,191 INFO L87 Difference]: Start difference. First operand has 185 states, 119 states have (on average 1.2100840336134453) internal successors, (144), 120 states have internal predecessors, (144), 46 states have call successors, (46), 18 states have call predecessors, (46), 18 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 03:04:36,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:04:36,215 INFO L93 Difference]: Finished difference Result 347 states and 465 transitions. [2025-03-04 03:04:36,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 03:04:36,217 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 137 [2025-03-04 03:04:36,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:04:36,222 INFO L225 Difference]: With dead ends: 347 [2025-03-04 03:04:36,222 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 03:04:36,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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:04:36,226 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:04:36,226 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:04:36,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 03:04:36,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-04 03:04:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 115 states have (on average 1.2) internal successors, (138), 116 states have internal predecessors, (138), 46 states have call successors, (46), 18 states have call predecessors, (46), 18 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 03:04:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 229 transitions. [2025-03-04 03:04:36,278 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 229 transitions. Word has length 137 [2025-03-04 03:04:36,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:04:36,280 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 229 transitions. [2025-03-04 03:04:36,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 03:04:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 229 transitions. [2025-03-04 03:04:36,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 03:04:36,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:04:36,284 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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:04:36,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 03:04:36,485 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:04:36,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:04:36,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:04:36,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1679278501, now seen corresponding path program 1 times [2025-03-04 03:04:36,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:04:36,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200664143] [2025-03-04 03:04:36,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:04:36,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:04:40,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 03:04:40,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 03:04:40,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:04:40,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:04:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-04 03:04:41,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:04:41,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200664143] [2025-03-04 03:04:41,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200664143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:04:41,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:04:41,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:04:41,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123297257] [2025-03-04 03:04:41,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:04:41,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:04:41,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:04:41,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:04:41,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:04:41,717 INFO L87 Difference]: Start difference. First operand 180 states and 229 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 03:04:42,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:04:42,250 INFO L93 Difference]: Finished difference Result 306 states and 389 transitions. [2025-03-04 03:04:42,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:04:42,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 137 [2025-03-04 03:04:42,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:04:42,255 INFO L225 Difference]: With dead ends: 306 [2025-03-04 03:04:42,255 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 03:04:42,256 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:04:42,259 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 7 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 03:04:42,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 828 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 03:04:42,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 03:04:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-04 03:04:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 115 states have (on average 1.191304347826087) internal successors, (137), 116 states have internal predecessors, (137), 46 states have call successors, (46), 18 states have call predecessors, (46), 18 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 03:04:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 228 transitions. [2025-03-04 03:04:42,280 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 228 transitions. Word has length 137 [2025-03-04 03:04:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:04:42,281 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 228 transitions. [2025-03-04 03:04:42,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 03:04:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 228 transitions. [2025-03-04 03:04:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 03:04:42,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:04:42,283 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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:04:42,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:04:42,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:04:42,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:04:42,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1018907565, now seen corresponding path program 1 times [2025-03-04 03:04:42,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:04:42,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262555445] [2025-03-04 03:04:42,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:04:42,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:04:45,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 03:04:46,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 03:04:46,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:04:46,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:04:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-04 03:04:47,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:04:47,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262555445] [2025-03-04 03:04:47,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262555445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:04:47,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19006123] [2025-03-04 03:04:47,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:04:47,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:04:47,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:04:47,477 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:04:47,478 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:04:51,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 03:04:51,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 03:04:51,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:04:51,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:04:51,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 4570 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 03:04:51,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:04:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 03:04:53,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:04:53,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19006123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:04:53,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:04:53,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-03-04 03:04:53,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687706223] [2025-03-04 03:04:53,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:04:53,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 03:04:53,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:04:53,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 03:04:53,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 03:04:53,675 INFO L87 Difference]: Start difference. First operand 180 states and 228 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 03:04:57,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:04:57,232 INFO L93 Difference]: Finished difference Result 325 states and 418 transitions. [2025-03-04 03:04:57,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 03:04:57,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 145 [2025-03-04 03:04:57,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:04:57,236 INFO L225 Difference]: With dead ends: 325 [2025-03-04 03:04:57,236 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 03:04:57,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 140 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:04:57,238 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 264 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-04 03:04:57,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1064 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-04 03:04:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 03:04:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-03-04 03:04:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 116 states have (on average 1.1896551724137931) internal successors, (138), 118 states have internal predecessors, (138), 46 states have call successors, (46), 18 states have call predecessors, (46), 19 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2025-03-04 03:04:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 232 transitions. [2025-03-04 03:04:57,252 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 232 transitions. Word has length 145 [2025-03-04 03:04:57,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:04:57,252 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 232 transitions. [2025-03-04 03:04:57,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 03:04:57,252 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 232 transitions. [2025-03-04 03:04:57,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 03:04:57,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:04:57,254 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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:04:57,271 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:04:57,454 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:04:57,455 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:04:57,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:04:57,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1600035518, now seen corresponding path program 1 times [2025-03-04 03:04:57,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:04:57,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933562053] [2025-03-04 03:04:57,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:04:57,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:05:01,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 03:05:01,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 03:05:01,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:05:01,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:05:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-04 03:05:02,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:05:02,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933562053] [2025-03-04 03:05:02,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933562053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:05:02,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:05:02,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:05:02,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556421126] [2025-03-04 03:05:02,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:05:02,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:05:02,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:05:02,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:05:02,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:05:02,545 INFO L87 Difference]: Start difference. First operand 182 states and 232 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 03:05:03,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:05:03,483 INFO L93 Difference]: Finished difference Result 311 states and 396 transitions. [2025-03-04 03:05:03,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:05:03,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 160 [2025-03-04 03:05:03,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:05:03,486 INFO L225 Difference]: With dead ends: 311 [2025-03-04 03:05:03,486 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 03:05:03,486 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:05:03,487 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 24 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 03:05:03,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 989 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 03:05:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 03:05:03,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-03-04 03:05:03,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 118 states have internal predecessors, (137), 46 states have call successors, (46), 18 states have call predecessors, (46), 19 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2025-03-04 03:05:03,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 231 transitions. [2025-03-04 03:05:03,501 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 231 transitions. Word has length 160 [2025-03-04 03:05:03,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:05:03,502 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 231 transitions. [2025-03-04 03:05:03,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 03:05:03,502 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 231 transitions. [2025-03-04 03:05:03,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 03:05:03,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:05:03,504 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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:05:03,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:05:03,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:05:03,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:05:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2110723911, now seen corresponding path program 1 times [2025-03-04 03:05:03,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:05:03,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403288579] [2025-03-04 03:05:03,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:05:03,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:05:07,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 03:05:07,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 03:05:07,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:05:07,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:05:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-03-04 03:05:08,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:05:08,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403288579] [2025-03-04 03:05:08,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403288579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:05:08,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252463573] [2025-03-04 03:05:08,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:05:08,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:05:08,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:05:08,677 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:05:08,678 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:05:12,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 03:05:13,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 03:05:13,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:05:13,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:05:13,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 4764 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 03:05:13,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:05:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-04 03:05:15,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:05:15,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252463573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:05:15,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:05:15,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-03-04 03:05:15,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421648050] [2025-03-04 03:05:15,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:05:15,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 03:05:15,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:05:15,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 03:05:15,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-04 03:05:15,385 INFO L87 Difference]: Start difference. First operand 182 states and 231 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 5 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2025-03-04 03:05:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:05:19,648 INFO L93 Difference]: Finished difference Result 324 states and 413 transitions. [2025-03-04 03:05:19,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 03:05:19,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 5 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 176 [2025-03-04 03:05:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:05:19,650 INFO L225 Difference]: With dead ends: 324 [2025-03-04 03:05:19,650 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 03:05:19,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-03-04 03:05:19,651 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 279 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:05:19,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1180 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-04 03:05:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 03:05:19,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-03-04 03:05:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 118 states have internal predecessors, (137), 46 states have call successors, (46), 18 states have call predecessors, (46), 19 states have return successors, (47), 45 states have call predecessors, (47), 45 states have call successors, (47) [2025-03-04 03:05:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 230 transitions. [2025-03-04 03:05:19,671 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 230 transitions. Word has length 176 [2025-03-04 03:05:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:05:19,672 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 230 transitions. [2025-03-04 03:05:19,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 5 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2025-03-04 03:05:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 230 transitions. [2025-03-04 03:05:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-04 03:05:19,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:05:19,675 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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:05:19,694 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:05:19,876 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:05:19,876 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:05:19,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:05:19,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1417750230, now seen corresponding path program 2 times [2025-03-04 03:05:19,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:05:19,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961440528] [2025-03-04 03:05:19,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:05:19,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:05:23,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 191 statements into 2 equivalence classes. [2025-03-04 03:05:23,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 03:05:23,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 03:05:23,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:05:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-04 03:05:25,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:05:25,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961440528] [2025-03-04 03:05:25,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961440528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:05:25,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:05:25,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 03:05:25,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944006571] [2025-03-04 03:05:25,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:05:25,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 03:05:25,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:05:25,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 03:05:25,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 03:05:25,399 INFO L87 Difference]: Start difference. First operand 182 states and 230 transitions. Second operand has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 5 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-04 03:05:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:05:26,891 INFO L93 Difference]: Finished difference Result 285 states and 357 transitions. [2025-03-04 03:05:26,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 03:05:26,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 5 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 191 [2025-03-04 03:05:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:05:26,895 INFO L225 Difference]: With dead ends: 285 [2025-03-04 03:05:26,895 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 03:05:26,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 03:05:26,896 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 25 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:05:26,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1377 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 03:05:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 03:05:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-04 03:05:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 115 states have (on average 1.173913043478261) internal successors, (135), 116 states have internal predecessors, (135), 46 states have call successors, (46), 18 states have call predecessors, (46), 18 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 03:05:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 226 transitions. [2025-03-04 03:05:26,907 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 226 transitions. Word has length 191 [2025-03-04 03:05:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:05:26,908 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 226 transitions. [2025-03-04 03:05:26,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 5 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-04 03:05:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 226 transitions. [2025-03-04 03:05:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-04 03:05:26,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:05:26,910 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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:05:26,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 03:05:26,910 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:05:26,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:05:26,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1135019852, now seen corresponding path program 1 times [2025-03-04 03:05:26,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:05:26,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062902624] [2025-03-04 03:05:26,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:05:26,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:05:30,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-04 03:05:32,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-04 03:05:32,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:05:32,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat