./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_priority_queue_init_static_harness_negated.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_init_static_harness_negated.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 188eb157187c65ed20c0598818206541e0c8a29005d59be8891bc5ebe4132fce --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:02:23,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:02:23,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:02:23,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:02:23,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:02:23,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:02:23,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:02:23,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:02:23,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:02:23,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:02:23,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:02:23,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:02:23,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:02:23,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:02:23,775 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:02:23,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:02:23,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:02:23,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:02:23,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:02:23,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:02:23,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:02:23,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:02:23,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:02:23,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:02:23,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:02:23,776 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:02:23,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:02:23,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:02:23,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:02:23,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:02:23,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:02:23,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:02:23,777 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:02:23,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:02:23,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:02:23,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:02:23,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:02:23,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:02:23,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:02:23,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:02:23,778 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 -> 188eb157187c65ed20c0598818206541e0c8a29005d59be8891bc5ebe4132fce [2025-03-04 03:02:24,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:02:24,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:02:24,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:02:24,027 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:02:24,028 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:02:24,029 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_init_static_harness_negated.i [2025-03-04 03:02:25,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0e7e5e3/4bd291314e1c44f8907a6ef4306cca5e/FLAG02f88eb1a [2025-03-04 03:02:25,632 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:02:25,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_init_static_harness_negated.i [2025-03-04 03:02:25,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0e7e5e3/4bd291314e1c44f8907a6ef4306cca5e/FLAG02f88eb1a [2025-03-04 03:02:25,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0e7e5e3/4bd291314e1c44f8907a6ef4306cca5e [2025-03-04 03:02:25,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:02:25,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:02:25,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:02:25,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:02:25,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:02:25,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:02:25" (1/1) ... [2025-03-04 03:02:25,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47a97f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:02:25, skipping insertion in model container [2025-03-04 03:02:25,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:02:25" (1/1) ... [2025-03-04 03:02:25,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:02:26,060 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_init_static_harness_negated.i[4504,4517] [2025-03-04 03:02:26,067 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_init_static_harness_negated.i[4564,4577] [2025-03-04 03:02:26,580 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:26,581 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:26,581 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:26,581 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:26,582 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:26,599 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:26,600 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:26,601 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:26,601 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:26,910 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:26,911 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:26,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:02:26,977 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:02:26,994 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_init_static_harness_negated.i[4504,4517] [2025-03-04 03:02:26,995 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_init_static_harness_negated.i[4564,4577] [2025-03-04 03:02:27,053 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:27,054 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:27,054 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:27,054 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:27,055 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:27,059 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:27,060 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:27,060 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:27,060 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:27,140 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:27,140 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:02:27,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7671-7682] [2025-03-04 03:02:27,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:02:27,295 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:02:27,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:02:27 WrapperNode [2025-03-04 03:02:27,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:02:27,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:02:27,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:02:27,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:02:27,301 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:02:27" (1/1) ... [2025-03-04 03:02:27,362 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:02:27" (1/1) ... [2025-03-04 03:02:27,403 INFO L138 Inliner]: procedures = 678, calls = 1525, calls flagged for inlining = 53, calls inlined = 9, statements flattened = 683 [2025-03-04 03:02:27,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:02:27,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:02:27,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:02:27,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:02:27,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:02:27" (1/1) ... [2025-03-04 03:02:27,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:02:27" (1/1) ... [2025-03-04 03:02:27,421 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:02:27" (1/1) ... [2025-03-04 03:02:27,476 INFO L175 MemorySlicer]: Split 296 memory accesses to 5 slices as follows [2, 238, 49, 2, 5]. 80 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 6, 2, 0, 5]. The 252 writes are split as follows [0, 232, 20, 0, 0]. [2025-03-04 03:02:27,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:02:27" (1/1) ... [2025-03-04 03:02:27,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:02:27" (1/1) ... [2025-03-04 03:02:27,504 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:02:27" (1/1) ... [2025-03-04 03:02:27,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:02:27" (1/1) ... [2025-03-04 03:02:27,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:02:27" (1/1) ... [2025-03-04 03:02:27,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:02:27" (1/1) ... [2025-03-04 03:02:27,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:02:27,533 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:02:27,533 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:02:27,533 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:02:27,534 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:02:27" (1/1) ... [2025-03-04 03:02:27,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:02:27,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:02:27,562 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:02:27,564 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:02:27,581 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-03-04 03:02:27,582 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-03-04 03:02:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:02:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2025-03-04 03:02:27,583 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2025-03-04 03:02:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:02:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:02:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:02:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:02:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:02:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:02:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:02:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:02:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:02:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 03:02:27,585 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 03:02:27,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:02:27,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 03:02:27,585 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-03-04 03:02:27,585 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 03:02:27,585 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_is_valid [2025-03-04 03:02:27,585 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_is_valid [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 03:02:27,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 03:02:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 03:02:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 03:02:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 03:02:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 03:02:27,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 03:02:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 03:02:27,586 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 03:02:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:02:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:02:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:02:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:02:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:02:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2025-03-04 03:02:27,586 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2025-03-04 03:02:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2025-03-04 03:02:27,586 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2025-03-04 03:02:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:02:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:02:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:02:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:02:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:02:27,806 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:02:27,808 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:02:27,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc #t~malloc77.base, #t~malloc77.offset; [2025-03-04 03:02:27,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-03-04 03:02:27,879 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc #t~ret57#1; [2025-03-04 03:02:27,881 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 03:02:27,918 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7309: havoc #t~ret656.base, #t~ret656.offset; [2025-03-04 03:02:27,988 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7462: havoc aws_priority_queue_backpointers_valid_#t~ret686#1;havoc aws_priority_queue_backpointers_valid_#t~short687#1; [2025-03-04 03:02:28,023 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:02:33,499 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2025-03-04 03:02:33,499 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:02:33,510 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:02:33,512 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 03:02:33,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:02:33 BoogieIcfgContainer [2025-03-04 03:02:33,513 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:02:33,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:02:33,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:02:33,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:02:33,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:02:25" (1/3) ... [2025-03-04 03:02:33,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efbab7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:02:33, skipping insertion in model container [2025-03-04 03:02:33,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:02:27" (2/3) ... [2025-03-04 03:02:33,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efbab7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:02:33, skipping insertion in model container [2025-03-04 03:02:33,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:02:33" (3/3) ... [2025-03-04 03:02:33,521 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_init_static_harness_negated.i [2025-03-04 03:02:33,533 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:02:33,534 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_priority_queue_init_static_harness_negated.i that has 14 procedures, 165 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 03:02:33,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:02:33,594 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;@788ce2d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:02:33,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:02:33,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 103 states have (on average 1.203883495145631) internal successors, (124), 103 states have internal predecessors, (124), 48 states have call successors, (48), 13 states have call predecessors, (48), 13 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 03:02:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 03:02:33,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:02:33,611 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 9, 9, 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] [2025-03-04 03:02:33,611 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:02:33,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:02:33,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1970392697, now seen corresponding path program 1 times [2025-03-04 03:02:33,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:02:33,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022849129] [2025-03-04 03:02:33,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:02:33,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:02:37,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 03:02:38,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 03:02:38,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:02:38,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:02:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2025-03-04 03:02:38,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:02:38,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022849129] [2025-03-04 03:02:38,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022849129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:02:38,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579709968] [2025-03-04 03:02:38,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:02:38,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:02:38,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:02:38,757 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:02:38,759 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:02:43,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 03:02:43,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 03:02:43,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:02:43,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:02:43,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 4467 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 03:02:43,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:02:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2025-03-04 03:02:43,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:02:43,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579709968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:02:43,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:02:43,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 03:02:43,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014025155] [2025-03-04 03:02:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:02:43,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 03:02:43,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:02:43,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 03:02:43,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 03:02:43,627 INFO L87 Difference]: Start difference. First operand has 165 states, 103 states have (on average 1.203883495145631) internal successors, (124), 103 states have internal predecessors, (124), 48 states have call successors, (48), 13 states have call predecessors, (48), 13 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-04 03:02:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:02:43,655 INFO L93 Difference]: Finished difference Result 306 states and 434 transitions. [2025-03-04 03:02:43,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 03:02:43,659 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 155 [2025-03-04 03:02:43,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:02:43,667 INFO L225 Difference]: With dead ends: 306 [2025-03-04 03:02:43,667 INFO L226 Difference]: Without dead ends: 159 [2025-03-04 03:02:43,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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:02:43,676 INFO L435 NwaCegarLoop]: 216 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, 216 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:02:43,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:02:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-04 03:02:43,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-04 03:02:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 97 states have (on average 1.175257731958763) internal successors, (114), 98 states have internal predecessors, (114), 48 states have call successors, (48), 13 states have call predecessors, (48), 13 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 03:02:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 209 transitions. [2025-03-04 03:02:43,728 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 209 transitions. Word has length 155 [2025-03-04 03:02:43,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:02:43,730 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 209 transitions. [2025-03-04 03:02:43,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-04 03:02:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 209 transitions. [2025-03-04 03:02:43,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 03:02:43,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:02:43,739 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 9, 9, 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] [2025-03-04 03:02:43,756 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:02:43,940 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:02:43,941 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:02:43,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:02:43,942 INFO L85 PathProgramCache]: Analyzing trace with hash 764241865, now seen corresponding path program 1 times [2025-03-04 03:02:43,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:02:43,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055765842] [2025-03-04 03:02:43,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:02:43,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:02:47,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 03:02:47,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 03:02:47,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:02:47,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:02:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2025-03-04 03:02:49,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:02:49,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055765842] [2025-03-04 03:02:49,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055765842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:02:49,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:02:49,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 03:02:49,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487281002] [2025-03-04 03:02:49,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:02:49,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:02:49,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:02:49,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:02:49,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:02:49,735 INFO L87 Difference]: Start difference. First operand 159 states and 209 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (30), 5 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-04 03:02:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:02:51,290 INFO L93 Difference]: Finished difference Result 253 states and 328 transitions. [2025-03-04 03:02:51,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:02:51,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (30), 5 states have call predecessors, (30), 4 states have call successors, (30) Word has length 172 [2025-03-04 03:02:51,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:02:51,294 INFO L225 Difference]: With dead ends: 253 [2025-03-04 03:02:51,294 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 03:02:51,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:02:51,296 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 38 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:02:51,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1002 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 03:02:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 03:02:51,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-03-04 03:02:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 98 states have (on average 1.1734693877551021) internal successors, (115), 100 states have internal predecessors, (115), 48 states have call successors, (48), 13 states have call predecessors, (48), 14 states have return successors, (49), 47 states have call predecessors, (49), 47 states have call successors, (49) [2025-03-04 03:02:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 212 transitions. [2025-03-04 03:02:51,311 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 212 transitions. Word has length 172 [2025-03-04 03:02:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:02:51,313 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 212 transitions. [2025-03-04 03:02:51,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (30), 5 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-04 03:02:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 212 transitions. [2025-03-04 03:02:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-04 03:02:51,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:02:51,315 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:02:51,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:02:51,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:02:51,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1089988692, now seen corresponding path program 1 times [2025-03-04 03:02:51,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:02:51,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203038449] [2025-03-04 03:02:51,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:02:51,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:02:55,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 03:02:55,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 03:02:55,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:02:55,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:02:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2025-03-04 03:02:56,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:02:56,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203038449] [2025-03-04 03:02:56,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203038449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:02:56,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:02:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:02:56,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777829352] [2025-03-04 03:02:56,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:02:56,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:02:56,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:02:56,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:02:56,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:02:56,877 INFO L87 Difference]: Start difference. First operand 161 states and 212 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2025-03-04 03:02:57,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:02:57,410 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2025-03-04 03:02:57,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:02:57,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) Word has length 187 [2025-03-04 03:02:57,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:02:57,413 INFO L225 Difference]: With dead ends: 274 [2025-03-04 03:02:57,413 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 03:02:57,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:02:57,415 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 6 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:02:57,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1003 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 03:02:57,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 03:02:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-03-04 03:02:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 98 states have (on average 1.163265306122449) internal successors, (114), 100 states have internal predecessors, (114), 48 states have call successors, (48), 13 states have call predecessors, (48), 14 states have return successors, (49), 47 states have call predecessors, (49), 47 states have call successors, (49) [2025-03-04 03:02:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 211 transitions. [2025-03-04 03:02:57,427 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 211 transitions. Word has length 187 [2025-03-04 03:02:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:02:57,427 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 211 transitions. [2025-03-04 03:02:57,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2025-03-04 03:02:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 211 transitions. [2025-03-04 03:02:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-04 03:02:57,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:02:57,429 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 03:02:57,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:02:57,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:02:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1717646167, now seen corresponding path program 1 times [2025-03-04 03:02:57,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:02:57,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739101514] [2025-03-04 03:02:57,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:02:57,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:03:01,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 03:03:02,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 03:03:02,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:03:02,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:03:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2025-03-04 03:03:04,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:03:04,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739101514] [2025-03-04 03:03:04,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739101514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:03:04,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:03:04,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 03:03:04,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668038678] [2025-03-04 03:03:04,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:03:04,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:03:04,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:03:04,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:03:04,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:03:04,262 INFO L87 Difference]: Start difference. First operand 161 states and 211 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2025-03-04 03:03:04,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:03:04,708 INFO L93 Difference]: Finished difference Result 275 states and 357 transitions. [2025-03-04 03:03:04,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:03:04,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) Word has length 188 [2025-03-04 03:03:04,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:03:04,712 INFO L225 Difference]: With dead ends: 275 [2025-03-04 03:03:04,712 INFO L226 Difference]: Without dead ends: 162 [2025-03-04 03:03:04,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 03:03:04,713 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 6 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:03:04,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1003 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 03:03:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-04 03:03:04,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-04 03:03:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 99 states have (on average 1.1616161616161615) internal successors, (115), 101 states have internal predecessors, (115), 48 states have call successors, (48), 13 states have call predecessors, (48), 14 states have return successors, (49), 47 states have call predecessors, (49), 47 states have call successors, (49) [2025-03-04 03:03:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 212 transitions. [2025-03-04 03:03:04,728 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 212 transitions. Word has length 188 [2025-03-04 03:03:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:03:04,728 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 212 transitions. [2025-03-04 03:03:04,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2025-03-04 03:03:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 212 transitions. [2025-03-04 03:03:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-04 03:03:04,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:03:04,731 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:04,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:03:04,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:03:04,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:03:04,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1611233970, now seen corresponding path program 1 times [2025-03-04 03:03:04,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:03:04,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155099367] [2025-03-04 03:03:04,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:03:04,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:03:08,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 03:03:09,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 03:03:09,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:03:09,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:03:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2025-03-04 03:03:11,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:03:11,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155099367] [2025-03-04 03:03:11,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155099367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:03:11,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818707910] [2025-03-04 03:03:11,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:03:11,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:03:11,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:03:11,151 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:03:11,152 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:03:15,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 03:03:15,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 03:03:15,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:03:15,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:03:15,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 4694 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-04 03:03:15,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:03:15,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 03:03:21,229 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 03:03:21,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 03:03:26,159 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 03:03:26,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 03:03:34,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 03:03:37,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 03:03:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 3 proven. 153 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-03-04 03:03:43,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:03:45,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818707910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:03:45,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 03:03:45,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 26] total 33 [2025-03-04 03:03:45,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473730431] [2025-03-04 03:03:45,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 03:03:45,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 03:03:45,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:03:45,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 03:03:45,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 03:03:45,185 INFO L87 Difference]: Start difference. First operand 162 states and 212 transitions. Second operand has 33 states, 29 states have (on average 4.137931034482759) internal successors, (120), 29 states have internal predecessors, (120), 16 states have call successors, (65), 7 states have call predecessors, (65), 9 states have return successors, (64), 16 states have call predecessors, (64), 16 states have call successors, (64) [2025-03-04 03:03:49,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:03:53,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []