./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_iter_done_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_hash_iter_done_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 d34d53474a6dd5633bd951a9e5bfed12ba51b1f6f82e68b7dee25b33fb7badae --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:52:44,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:52:44,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:52:44,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:52:44,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:52:44,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:52:44,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:52:44,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:52:44,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:52:44,575 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:52:44,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:52:44,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:52:44,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:52:44,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:52:44,576 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:52:44,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:52:44,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:52:44,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:52:44,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:52:44,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:52:44,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:52:44,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:52:44,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:52:44,576 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:52:44,576 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:52:44,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:52:44,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:52:44,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:52:44,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:52:44,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:52:44,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:52:44,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:52:44,577 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:52:44,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:52:44,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:52:44,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:52:44,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:52:44,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:52:44,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:52:44,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:52:44,577 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 -> d34d53474a6dd5633bd951a9e5bfed12ba51b1f6f82e68b7dee25b33fb7badae [2025-03-04 02:52:44,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:52:44,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:52:44,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:52:44,842 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:52:44,843 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:52:44,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_iter_done_harness_negated.i [2025-03-04 02:52:46,058 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1468200e9/69cc46bd280d442ca332212a073ce0ff/FLAGa932da7aa [2025-03-04 02:52:46,479 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:52:46,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_iter_done_harness_negated.i [2025-03-04 02:52:46,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1468200e9/69cc46bd280d442ca332212a073ce0ff/FLAGa932da7aa [2025-03-04 02:52:46,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1468200e9/69cc46bd280d442ca332212a073ce0ff [2025-03-04 02:52:46,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:52:46,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:52:46,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:52:46,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:52:46,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:52:46,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:52:46" (1/1) ... [2025-03-04 02:52:46,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b328b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:46, skipping insertion in model container [2025-03-04 02:52:46,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:52:46" (1/1) ... [2025-03-04 02:52:46,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:52:46,950 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_hash_iter_done_harness_negated.i[4492,4505] [2025-03-04 02:52:46,958 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_hash_iter_done_harness_negated.i[4552,4565] [2025-03-04 02:52:47,757 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,758 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,758 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,758 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,759 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,769 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,769 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,771 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,771 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,772 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,772 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,606 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,607 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,637 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,638 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,644 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,644 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,662 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,665 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,665 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,666 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,666 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,667 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,667 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,701 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_hash_iter_done_harness_negated.i[228343,228356] [2025-03-04 02:52:48,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:52:48,728 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:52:48,738 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_hash_iter_done_harness_negated.i[4492,4505] [2025-03-04 02:52:48,742 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_hash_iter_done_harness_negated.i[4552,4565] [2025-03-04 02:52:48,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,769 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,772 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,773 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,773 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,774 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,774 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,774 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,775 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,775 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7526-7537] [2025-03-04 02:52:48,889 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,890 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,930 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,932 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,934 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,934 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,940 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,941 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,941 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,941 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,941 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,942 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,943 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:48,955 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_hash_iter_done_harness_negated.i[228343,228356] [2025-03-04 02:52:48,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:52:49,102 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:52:49,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:49 WrapperNode [2025-03-04 02:52:49,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:52:49,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:52:49,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:52:49,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:52:49,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:49" (1/1) ... [2025-03-04 02:52:49,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:49" (1/1) ... [2025-03-04 02:52:49,231 INFO L138 Inliner]: procedures = 763, calls = 2449, calls flagged for inlining = 68, calls inlined = 11, statements flattened = 644 [2025-03-04 02:52:49,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:52:49,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:52:49,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:52:49,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:52:49,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:49" (1/1) ... [2025-03-04 02:52:49,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:49" (1/1) ... [2025-03-04 02:52:49,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:49" (1/1) ... [2025-03-04 02:52:49,316 INFO L175 MemorySlicer]: Split 318 memory accesses to 9 slices as follows [238, 3, 2, 19, 7, 6, 36, 2, 5]. 75 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [6, 0, 2, 0, 0, 0, 9, 0, 5]. The 239 writes are split as follows [232, 1, 0, 1, 1, 2, 1, 1, 0]. [2025-03-04 02:52:49,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:49" (1/1) ... [2025-03-04 02:52:49,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:49" (1/1) ... [2025-03-04 02:52:49,343 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:49" (1/1) ... [2025-03-04 02:52:49,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:49" (1/1) ... [2025-03-04 02:52:49,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:49" (1/1) ... [2025-03-04 02:52:49,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:49" (1/1) ... [2025-03-04 02:52:49,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:52:49,379 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:52:49,379 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:52:49,379 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:52:49,380 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:49" (1/1) ... [2025-03-04 02:52:49,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:52:49,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:52:49,411 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 02:52:49,413 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 02:52:49,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 02:52:49,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 02:52:49,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 02:52:49,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 02:52:49,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 02:52:49,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 02:52:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 02:52:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-04 02:52:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-04 02:52:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:52:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 02:52:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 02:52:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 02:52:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 02:52:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 02:52:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 02:52:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 02:52:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 02:52:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 02:52:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:52:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:52:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:52:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 02:52:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 02:52:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 02:52:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 02:52:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 02:52:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 02:52:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_done [2025-03-04 02:52:49,435 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_done [2025-03-04 02:52:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 02:52:49,435 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 02:52:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:52:49,435 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:52:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-03-04 02:52:49,435 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-03-04 02:52:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:52:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:52:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-03-04 02:52:49,436 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-03-04 02:52:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:52:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:52:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:52:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 02:52:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:52:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 02:52:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 02:52:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:52:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_is_valid [2025-03-04 02:52:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_is_valid [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-04 02:52:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-03-04 02:52:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 02:52:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 02:52:49,438 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-03-04 02:52:49,438 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:52:49,438 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 02:52:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-03-04 02:52:49,440 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-03-04 02:52:49,746 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:52:49,749 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:52:49,782 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6935: havoc #t~malloc588.base, #t~malloc588.offset; [2025-03-04 02:52:49,815 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-03-04 02:52:49,820 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:52:49,930 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10069: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-03-04 02:52:49,978 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9956: havoc #t~mem1489.base, #t~mem1489.offset;havoc #t~short1490;havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~ret1492;havoc #t~short1493; [2025-03-04 02:52:49,995 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-03-04 02:52:50,006 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-03-04 02:52:55,115 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc nondet_size_t_#t~nondet6#1; [2025-03-04 02:52:55,171 INFO L? ?]: Removed 154 outVars from TransFormulas that were not future-live. [2025-03-04 02:52:55,171 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:52:55,189 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:52:55,189 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:52:55,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:52:55 BoogieIcfgContainer [2025-03-04 02:52:55,190 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:52:55,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:52:55,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:52:55,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:52:55,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:52:46" (1/3) ... [2025-03-04 02:52:55,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79692535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:52:55, skipping insertion in model container [2025-03-04 02:52:55,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:49" (2/3) ... [2025-03-04 02:52:55,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79692535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:52:55, skipping insertion in model container [2025-03-04 02:52:55,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:52:55" (3/3) ... [2025-03-04 02:52:55,197 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_iter_done_harness_negated.i [2025-03-04 02:52:55,209 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:52:55,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_iter_done_harness_negated.i that has 16 procedures, 163 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 02:52:55,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:52:55,263 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;@61c471c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:52:55,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:52:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 106 states have (on average 1.2452830188679245) internal successors, (132), 107 states have internal predecessors, (132), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 02:52:55,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 02:52:55,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:52:55,276 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-03-04 02:52:55,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:52:55,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:52:55,281 INFO L85 PathProgramCache]: Analyzing trace with hash 436238726, now seen corresponding path program 1 times [2025-03-04 02:52:55,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:52:55,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562910512] [2025-03-04 02:52:55,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:52:55,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:52:59,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 02:52:59,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 02:52:59,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:52:59,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-04 02:53:00,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:00,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562910512] [2025-03-04 02:53:00,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562910512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:53:00,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493466960] [2025-03-04 02:53:00,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:00,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:53:00,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:53:00,515 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 02:53:00,518 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 02:53:04,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 02:53:05,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 02:53:05,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:05,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:05,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 4452 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:53:05,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:53:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-04 02:53:05,539 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:53:05,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493466960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:53:05,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:53:05,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:53:05,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966239797] [2025-03-04 02:53:05,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:53:05,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:53:05,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:05,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:53:05,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:53:05,559 INFO L87 Difference]: Start difference. First operand has 163 states, 106 states have (on average 1.2452830188679245) internal successors, (132), 107 states have internal predecessors, (132), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 02:53:05,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:53:05,603 INFO L93 Difference]: Finished difference Result 318 states and 446 transitions. [2025-03-04 02:53:05,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:53:05,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 142 [2025-03-04 02:53:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:53:05,611 INFO L225 Difference]: With dead ends: 318 [2025-03-04 02:53:05,612 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 02:53:05,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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 02:53:05,616 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:53:05,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:53:05,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 02:53:05,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-04 02:53:05,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.2277227722772277) internal successors, (124), 102 states have internal predecessors, (124), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-04 02:53:05,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2025-03-04 02:53:05,649 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 142 [2025-03-04 02:53:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:53:05,649 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2025-03-04 02:53:05,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 02:53:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2025-03-04 02:53:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 02:53:05,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:53:05,655 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-03-04 02:53:05,670 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 02:53:05,855 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 02:53:05,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:53:05,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:53:05,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1523240504, now seen corresponding path program 1 times [2025-03-04 02:53:05,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:53:05,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898532593] [2025-03-04 02:53:05,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:05,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:53:09,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 02:53:09,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 02:53:09,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:09,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-04 02:53:10,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:10,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898532593] [2025-03-04 02:53:10,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898532593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:53:10,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429001471] [2025-03-04 02:53:10,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:10,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:53:10,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:53:10,795 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 02:53:10,796 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 02:53:14,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 02:53:15,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 02:53:15,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:15,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:15,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 4452 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:53:15,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:53:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 115 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 02:53:17,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:53:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-04 02:53:19,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429001471] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:53:19,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:53:19,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2025-03-04 02:53:19,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025444515] [2025-03-04 02:53:19,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:53:19,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:53:19,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:19,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:53:19,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:53:19,768 INFO L87 Difference]: Start difference. First operand 157 states and 203 transitions. Second operand has 12 states, 12 states have (on average 11.0) internal successors, (132), 12 states have internal predecessors, (132), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (54), 7 states have call predecessors, (54), 6 states have call successors, (54) [2025-03-04 02:53:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:53:23,611 INFO L93 Difference]: Finished difference Result 313 states and 410 transitions. [2025-03-04 02:53:23,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:53:23,612 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.0) internal successors, (132), 12 states have internal predecessors, (132), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (54), 7 states have call predecessors, (54), 6 states have call successors, (54) Word has length 142 [2025-03-04 02:53:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:53:23,614 INFO L225 Difference]: With dead ends: 313 [2025-03-04 02:53:23,615 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 02:53:23,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:53:23,616 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 179 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:53:23,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1279 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-04 02:53:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 02:53:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2025-03-04 02:53:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 108 states have internal predecessors, (129), 40 states have call successors, (40), 15 states have call predecessors, (40), 17 states have return successors, (42), 40 states have call predecessors, (42), 39 states have call successors, (42) [2025-03-04 02:53:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 211 transitions. [2025-03-04 02:53:23,636 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 211 transitions. Word has length 142 [2025-03-04 02:53:23,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:53:23,637 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 211 transitions. [2025-03-04 02:53:23,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.0) internal successors, (132), 12 states have internal predecessors, (132), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (54), 7 states have call predecessors, (54), 6 states have call successors, (54) [2025-03-04 02:53:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 211 transitions. [2025-03-04 02:53:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 02:53:23,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:53:23,644 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-03-04 02:53:23,662 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 02:53:23,844 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,SelfDestructingSolverStorable1 [2025-03-04 02:53:23,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:53:23,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:53:23,845 INFO L85 PathProgramCache]: Analyzing trace with hash -726673744, now seen corresponding path program 1 times [2025-03-04 02:53:23,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:53:23,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869872229] [2025-03-04 02:53:23,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:23,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:53:27,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 02:53:27,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 02:53:27,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:27,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-04 02:53:31,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:31,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869872229] [2025-03-04 02:53:31,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869872229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:53:31,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:53:31,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:53:31,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028611783] [2025-03-04 02:53:31,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:53:31,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:53:31,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:31,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:53:31,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:53:31,277 INFO L87 Difference]: Start difference. First operand 164 states and 211 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-04 02:53:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:53:33,843 INFO L93 Difference]: Finished difference Result 312 states and 404 transitions. [2025-03-04 02:53:33,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:53:33,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 155 [2025-03-04 02:53:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:53:33,846 INFO L225 Difference]: With dead ends: 312 [2025-03-04 02:53:33,846 INFO L226 Difference]: Without dead ends: 172 [2025-03-04 02:53:33,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:53:33,847 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 27 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:53:33,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1352 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 02:53:33,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-04 02:53:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2025-03-04 02:53:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 110 states have (on average 1.2181818181818183) internal successors, (134), 113 states have internal predecessors, (134), 40 states have call successors, (40), 15 states have call predecessors, (40), 18 states have return successors, (43), 40 states have call predecessors, (43), 39 states have call successors, (43) [2025-03-04 02:53:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 217 transitions. [2025-03-04 02:53:33,862 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 217 transitions. Word has length 155 [2025-03-04 02:53:33,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:53:33,863 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 217 transitions. [2025-03-04 02:53:33,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-04 02:53:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 217 transitions. [2025-03-04 02:53:33,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 02:53:33,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:53:33,865 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-03-04 02:53:33,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:53:33,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:53:33,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:53:33,866 INFO L85 PathProgramCache]: Analyzing trace with hash 923463055, now seen corresponding path program 1 times [2025-03-04 02:53:33,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:53:33,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26834292] [2025-03-04 02:53:33,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:33,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:53:37,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 02:53:37,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 02:53:37,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:37,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-04 02:53:38,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:38,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26834292] [2025-03-04 02:53:38,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26834292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:53:38,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:53:38,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:53:38,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996838963] [2025-03-04 02:53:38,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:53:38,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:53:38,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:38,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:53:38,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:53:38,487 INFO L87 Difference]: Start difference. First operand 169 states and 217 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 02:53:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:53:38,761 INFO L93 Difference]: Finished difference Result 319 states and 411 transitions. [2025-03-04 02:53:38,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:53:38,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 155 [2025-03-04 02:53:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:53:38,764 INFO L225 Difference]: With dead ends: 319 [2025-03-04 02:53:38,765 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 02:53:38,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:53:38,767 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 22 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:53:38,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 554 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 02:53:38,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 02:53:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2025-03-04 02:53:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 111 states have (on average 1.2162162162162162) internal successors, (135), 114 states have internal predecessors, (135), 41 states have call successors, (41), 15 states have call predecessors, (41), 18 states have return successors, (44), 41 states have call predecessors, (44), 40 states have call successors, (44) [2025-03-04 02:53:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 220 transitions. [2025-03-04 02:53:38,789 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 220 transitions. Word has length 155 [2025-03-04 02:53:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:53:38,789 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 220 transitions. [2025-03-04 02:53:38,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 02:53:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 220 transitions. [2025-03-04 02:53:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 02:53:38,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:53:38,795 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1] [2025-03-04 02:53:38,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:53:38,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:53:38,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:53:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash 940218047, now seen corresponding path program 1 times [2025-03-04 02:53:38,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:53:38,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113905890] [2025-03-04 02:53:38,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:38,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:53:42,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 02:53:42,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 02:53:42,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:42,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-04 02:53:44,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:44,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113905890] [2025-03-04 02:53:44,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113905890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:53:44,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:53:44,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:53:44,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836289901] [2025-03-04 02:53:44,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:53:44,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:53:44,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:44,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:53:44,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:53:44,558 INFO L87 Difference]: Start difference. First operand 171 states and 220 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 02:53:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:53:45,198 INFO L93 Difference]: Finished difference Result 321 states and 422 transitions. [2025-03-04 02:53:45,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:53:45,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) Word has length 161 [2025-03-04 02:53:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:53:45,200 INFO L225 Difference]: With dead ends: 321 [2025-03-04 02:53:45,200 INFO L226 Difference]: Without dead ends: 172 [2025-03-04 02:53:45,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:53:45,202 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 3 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 02:53:45,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1149 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 02:53:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-04 02:53:45,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2025-03-04 02:53:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 114 states have internal predecessors, (134), 41 states have call successors, (41), 15 states have call predecessors, (41), 18 states have return successors, (44), 41 states have call predecessors, (44), 40 states have call successors, (44) [2025-03-04 02:53:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 219 transitions. [2025-03-04 02:53:45,218 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 219 transitions. Word has length 161 [2025-03-04 02:53:45,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:53:45,218 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 219 transitions. [2025-03-04 02:53:45,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 02:53:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 219 transitions. [2025-03-04 02:53:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 02:53:45,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:53:45,220 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1] [2025-03-04 02:53:45,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:53:45,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:53:45,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:53:45,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1176499294, now seen corresponding path program 1 times [2025-03-04 02:53:45,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:53:45,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999438465] [2025-03-04 02:53:45,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:45,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:53:48,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 02:53:48,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 02:53:48,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:48,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:49,932 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-04 02:53:49,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:49,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999438465] [2025-03-04 02:53:49,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999438465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:53:49,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:53:49,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:53:49,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415783597] [2025-03-04 02:53:49,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:53:49,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:53:49,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:49,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:53:49,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:53:49,934 INFO L87 Difference]: Start difference. First operand 171 states and 219 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 4 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-04 02:53:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:53:51,369 INFO L93 Difference]: Finished difference Result 261 states and 338 transitions. [2025-03-04 02:53:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:53:51,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 4 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 168 [2025-03-04 02:53:51,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:53:51,371 INFO L225 Difference]: With dead ends: 261 [2025-03-04 02:53:51,371 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 02:53:51,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:53:51,372 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 48 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:53:51,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1003 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 02:53:51,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 02:53:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2025-03-04 02:53:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 110 states have (on average 1.2) internal successors, (132), 112 states have internal predecessors, (132), 41 states have call successors, (41), 15 states have call predecessors, (41), 17 states have return successors, (42), 41 states have call predecessors, (42), 40 states have call successors, (42) [2025-03-04 02:53:51,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 215 transitions. [2025-03-04 02:53:51,381 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 215 transitions. Word has length 168 [2025-03-04 02:53:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:53:51,382 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 215 transitions. [2025-03-04 02:53:51,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 4 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-04 02:53:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 215 transitions. [2025-03-04 02:53:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 02:53:51,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:53:51,384 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-03-04 02:53:51,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:53:51,384 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:53:51,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:53:51,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1501708106, now seen corresponding path program 1 times [2025-03-04 02:53:51,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:53:51,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313446879] [2025-03-04 02:53:51,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:51,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:53:54,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 02:53:55,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 02:53:55,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:55,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-04 02:53:56,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:56,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313446879] [2025-03-04 02:53:56,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313446879] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:53:56,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672910224] [2025-03-04 02:53:56,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:56,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:53:56,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:53:56,615 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 02:53:56,616 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 02:54:00,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 02:54:01,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 02:54:01,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:01,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:01,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 4526 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 02:54:01,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:54:01,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:54:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-04 02:54:06,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:54:06,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672910224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:06,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:54:06,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2025-03-04 02:54:06,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134667632] [2025-03-04 02:54:06,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:06,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:54:06,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:06,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:54:06,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:54:06,822 INFO L87 Difference]: Start difference. First operand 169 states and 215 transitions. Second operand has 11 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 6 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (26), 5 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-04 02:54:10,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:54:15,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]