./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness_negated.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 179a1ffc86769a00f66e166b0105235f9f4d772a412ed21eb988649ef2cb5874 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:13:49,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:13:49,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 05:13:49,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:13:49,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:13:49,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:13:49,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:13:49,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:13:49,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:13:49,643 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:13:49,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:13:49,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:13:49,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:13:49,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:13:49,644 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:13:49,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:13:49,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:13:49,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:13:49,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:13:49,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:13:49,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:13:49,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:13:49,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:13:49,644 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:13:49,645 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:13:49,645 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:13:49,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:13:49,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:13:49,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:13:49,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:13:49,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:13:49,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:13:49,645 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:13:49,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:13:49,645 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:13:49,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:13:49,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:13:49,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:13:49,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:13:49,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:13:49,645 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 179a1ffc86769a00f66e166b0105235f9f4d772a412ed21eb988649ef2cb5874 [2025-02-06 05:13:49,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:13:49,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:13:49,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:13:49,929 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:13:49,929 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:13:49,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness_negated.i [2025-02-06 05:13:51,157 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57ef71613/f3d833fc17714047a0710dbe1c4ad964/FLAG2dbd5fb37 [2025-02-06 05:13:51,694 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:13:51,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness_negated.i [2025-02-06 05:13:51,741 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57ef71613/f3d833fc17714047a0710dbe1c4ad964/FLAG2dbd5fb37 [2025-02-06 05:13:52,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57ef71613/f3d833fc17714047a0710dbe1c4ad964 [2025-02-06 05:13:52,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:13:52,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:13:52,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:13:52,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:13:52,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:13:52,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:13:52" (1/1) ... [2025-02-06 05:13:52,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c6f558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:52, skipping insertion in model container [2025-02-06 05:13:52,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:13:52" (1/1) ... [2025-02-06 05:13:52,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:13:52,603 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness_negated.i[4503,4516] [2025-02-06 05:13:52,615 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness_negated.i[4563,4576] [2025-02-06 05:13:53,451 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:53,452 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:53,452 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:53,453 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:53,454 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:53,464 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:53,465 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:53,466 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:53,467 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:53,468 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:53,472 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:53,472 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:53,472 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,063 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,063 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,082 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,082 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,088 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,088 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,101 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,102 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,102 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,102 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,102 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,103 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,103 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,187 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness_negated.i[228209,228222] [2025-02-06 05:13:54,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:13:54,219 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:13:54,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness_negated.i[4503,4516] [2025-02-06 05:13:54,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness_negated.i[4563,4576] [2025-02-06 05:13:54,274 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,275 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,275 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,275 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,275 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,280 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,282 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,283 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,283 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,284 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,285 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,285 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,285 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7544-7555] [2025-02-06 05:13:54,400 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,400 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,404 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,405 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,406 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,407 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,412 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,412 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,413 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,413 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,413 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,413 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,414 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:54,427 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness_negated.i[228209,228222] [2025-02-06 05:13:54,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:13:54,612 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:13:54,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:54 WrapperNode [2025-02-06 05:13:54,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:13:54,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:13:54,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:13:54,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:13:54,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:54" (1/1) ... [2025-02-06 05:13:54,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:54" (1/1) ... [2025-02-06 05:13:54,732 INFO L138 Inliner]: procedures = 764, calls = 2425, calls flagged for inlining = 66, calls inlined = 11, statements flattened = 831 [2025-02-06 05:13:54,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:13:54,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:13:54,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:13:54,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:13:54,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:54" (1/1) ... [2025-02-06 05:13:54,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:54" (1/1) ... [2025-02-06 05:13:54,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:54" (1/1) ... [2025-02-06 05:13:54,756 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 05:13:54,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:54" (1/1) ... [2025-02-06 05:13:54,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:54" (1/1) ... [2025-02-06 05:13:54,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:54" (1/1) ... [2025-02-06 05:13:54,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:54" (1/1) ... [2025-02-06 05:13:54,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:54" (1/1) ... [2025-02-06 05:13:54,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:54" (1/1) ... [2025-02-06 05:13:54,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:13:54,811 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:13:54,811 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:13:54,811 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:13:54,812 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:54" (1/1) ... [2025-02-06 05:13:54,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:13:54,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:13:54,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 05:13:54,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 05:13:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-02-06 05:13:54,857 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-02-06 05:13:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 05:13:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 05:13:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-02-06 05:13:54,857 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-02-06 05:13:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-02-06 05:13:54,857 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-02-06 05:13:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 05:13:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-02-06 05:13:54,859 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-02-06 05:13:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 05:13:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-06 05:13:54,859 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-06 05:13:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 05:13:54,859 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 05:13:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 05:13:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-02-06 05:13:54,859 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-02-06 05:13:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 05:13:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:13:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-02-06 05:13:54,859 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-02-06 05:13:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 05:13:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:13:54,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:13:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-02-06 05:13:54,859 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-02-06 05:13:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-06 05:13:54,860 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-06 05:13:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 05:13:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 05:13:54,860 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 05:13:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 05:13:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-02-06 05:13:54,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-02-06 05:13:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 05:13:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-02-06 05:13:54,860 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-02-06 05:13:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 05:13:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-02-06 05:13:54,860 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-02-06 05:13:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-06 05:13:54,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-06 05:13:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-02-06 05:13:54,860 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-02-06 05:13:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 05:13:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-02-06 05:13:54,860 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-02-06 05:13:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 05:13:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-02-06 05:13:54,860 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-02-06 05:13:55,088 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:13:55,090 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:13:55,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9974: havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~short1492;havoc #t~mem1493.base, #t~mem1493.offset;havoc #t~ret1494;havoc #t~short1495; [2025-02-06 05:13:55,130 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-02-06 05:13:55,155 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10087: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-02-06 05:13:55,193 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6943: havoc #t~ret589#1;havoc #t~ite591#1.base, #t~ite591#1.offset;havoc #t~ret590#1.base, #t~ret590#1.offset; [2025-02-06 05:13:55,193 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6928: havoc bounded_calloc_#t~malloc587#1.base, bounded_calloc_#t~malloc587#1.offset;call ULTIMATE.dealloc(bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset);havoc bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset; [2025-02-06 05:13:55,328 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9169: call ULTIMATE.dealloc(~#size~0#1.base, ~#size~0#1.offset);havoc ~#size~0#1.base, ~#size~0#1.offset; [2025-02-06 05:13:55,329 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-02-06 05:13:55,334 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6974: havoc #t~ret600.base, #t~ret600.offset; [2025-02-06 05:13:55,338 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-02-06 05:13:55,357 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-02-06 05:13:55,503 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9140: call ULTIMATE.dealloc(~#required_bytes~3#1.base, ~#required_bytes~3#1.offset);havoc ~#required_bytes~3#1.base, ~#required_bytes~3#1.offset; [2025-02-06 05:13:55,503 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6997: call ULTIMATE.dealloc(aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset);havoc aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset; [2025-02-06 05:13:55,523 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-02-06 05:13:55,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-02-06 05:14:00,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9228-1: assume false; [2025-02-06 05:14:00,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9228-1: assume !false; [2025-02-06 05:14:01,005 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2025-02-06 05:14:01,006 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:14:01,037 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:14:01,037 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:14:01,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:14:01 BoogieIcfgContainer [2025-02-06 05:14:01,038 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:14:01,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:14:01,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:14:01,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:14:01,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:13:52" (1/3) ... [2025-02-06 05:14:01,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b1cfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:14:01, skipping insertion in model container [2025-02-06 05:14:01,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:54" (2/3) ... [2025-02-06 05:14:01,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b1cfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:14:01, skipping insertion in model container [2025-02-06 05:14:01,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:14:01" (3/3) ... [2025-02-06 05:14:01,046 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_unbounded_harness_negated.i [2025-02-06 05:14:01,056 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:14:01,057 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_init_unbounded_harness_negated.i that has 19 procedures, 193 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 05:14:01,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:14:01,111 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;@4b2d3bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:14:01,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:14:01,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 193 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 139 states have internal predecessors, (177), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-06 05:14:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 05:14:01,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:01,123 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:14:01,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:01,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:01,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1522933011, now seen corresponding path program 1 times [2025-02-06 05:14:01,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:01,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306646799] [2025-02-06 05:14:01,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:01,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:05,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:14:05,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:14:05,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:05,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 05:14:06,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:06,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306646799] [2025-02-06 05:14:06,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306646799] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:14:06,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486315114] [2025-02-06 05:14:06,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:06,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:14:06,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:14:06,055 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:14:06,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 05:14:10,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:14:10,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:14:10,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:10,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:10,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 4093 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 05:14:10,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:14:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 05:14:10,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:14:10,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486315114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:10,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:14:10,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 05:14:10,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809660161] [2025-02-06 05:14:10,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:10,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 05:14:10,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:10,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 05:14:10,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:14:10,652 INFO L87 Difference]: Start difference. First operand has 193 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 139 states have internal predecessors, (177), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 05:14:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:10,758 INFO L93 Difference]: Finished difference Result 375 states and 499 transitions. [2025-02-06 05:14:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 05:14:10,759 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2025-02-06 05:14:10,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:10,765 INFO L225 Difference]: With dead ends: 375 [2025-02-06 05:14:10,765 INFO L226 Difference]: Without dead ends: 186 [2025-02-06 05:14:10,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:14:10,773 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:10,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:14:10,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-06 05:14:10,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-02-06 05:14:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 132 states have (on average 1.2575757575757576) internal successors, (166), 133 states have internal predecessors, (166), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 05:14:10,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 235 transitions. [2025-02-06 05:14:10,809 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 235 transitions. Word has length 70 [2025-02-06 05:14:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:10,811 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 235 transitions. [2025-02-06 05:14:10,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 05:14:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 235 transitions. [2025-02-06 05:14:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 05:14:10,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:10,813 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:14:10,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 05:14:11,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 05:14:11,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:11,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:11,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1971919573, now seen corresponding path program 1 times [2025-02-06 05:14:11,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:11,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206670556] [2025-02-06 05:14:11,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:11,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:14,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:14:14,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:14:14,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:14,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 05:14:15,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:15,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206670556] [2025-02-06 05:14:15,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206670556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:15,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:15,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:14:15,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066135059] [2025-02-06 05:14:15,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:15,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:14:15,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:15,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:14:15,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:15,733 INFO L87 Difference]: Start difference. First operand 186 states and 235 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 05:14:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:16,109 INFO L93 Difference]: Finished difference Result 319 states and 393 transitions. [2025-02-06 05:14:16,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:14:16,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2025-02-06 05:14:16,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:16,112 INFO L225 Difference]: With dead ends: 319 [2025-02-06 05:14:16,112 INFO L226 Difference]: Without dead ends: 188 [2025-02-06 05:14:16,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:16,113 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:16,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 673 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 05:14:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-06 05:14:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-02-06 05:14:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 135 states have internal predecessors, (168), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 05:14:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 237 transitions. [2025-02-06 05:14:16,135 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 237 transitions. Word has length 70 [2025-02-06 05:14:16,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:16,136 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 237 transitions. [2025-02-06 05:14:16,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 05:14:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 237 transitions. [2025-02-06 05:14:16,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 05:14:16,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:16,138 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:14:16,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 05:14:16,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:16,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:16,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1325313108, now seen corresponding path program 1 times [2025-02-06 05:14:16,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:16,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577831267] [2025-02-06 05:14:16,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:16,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:19,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 05:14:20,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 05:14:20,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:20,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 05:14:20,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:20,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577831267] [2025-02-06 05:14:20,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577831267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:20,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:20,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:14:20,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663413988] [2025-02-06 05:14:20,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:20,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:14:20,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:20,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:14:20,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:20,803 INFO L87 Difference]: Start difference. First operand 188 states and 237 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 05:14:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:21,166 INFO L93 Difference]: Finished difference Result 226 states and 280 transitions. [2025-02-06 05:14:21,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:14:21,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2025-02-06 05:14:21,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:21,169 INFO L225 Difference]: With dead ends: 226 [2025-02-06 05:14:21,169 INFO L226 Difference]: Without dead ends: 192 [2025-02-06 05:14:21,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:21,170 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:21,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 673 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 05:14:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-06 05:14:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-02-06 05:14:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 137 states have (on average 1.2481751824817517) internal successors, (171), 138 states have internal predecessors, (171), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (35), 35 states have call predecessors, (35), 34 states have call successors, (35) [2025-02-06 05:14:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 241 transitions. [2025-02-06 05:14:21,179 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 241 transitions. Word has length 72 [2025-02-06 05:14:21,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:21,180 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 241 transitions. [2025-02-06 05:14:21,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 05:14:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 241 transitions. [2025-02-06 05:14:21,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 05:14:21,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:21,182 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:14:21,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 05:14:21,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:21,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:21,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1050669427, now seen corresponding path program 1 times [2025-02-06 05:14:21,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:21,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513355101] [2025-02-06 05:14:21,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:21,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:24,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 05:14:24,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 05:14:24,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:24,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 05:14:25,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:25,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513355101] [2025-02-06 05:14:25,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513355101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:25,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:25,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:14:25,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581213541] [2025-02-06 05:14:25,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:25,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:14:25,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:25,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:14:25,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:25,400 INFO L87 Difference]: Start difference. First operand 192 states and 241 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 05:14:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:25,686 INFO L93 Difference]: Finished difference Result 226 states and 279 transitions. [2025-02-06 05:14:25,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:14:25,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2025-02-06 05:14:25,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:25,688 INFO L225 Difference]: With dead ends: 226 [2025-02-06 05:14:25,689 INFO L226 Difference]: Without dead ends: 192 [2025-02-06 05:14:25,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:25,689 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:25,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 675 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 05:14:25,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-06 05:14:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2025-02-06 05:14:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 134 states have (on average 1.2388059701492538) internal successors, (166), 135 states have internal predecessors, (166), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 05:14:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 235 transitions. [2025-02-06 05:14:25,702 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 235 transitions. Word has length 77 [2025-02-06 05:14:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:25,703 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 235 transitions. [2025-02-06 05:14:25,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 05:14:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 235 transitions. [2025-02-06 05:14:25,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 05:14:25,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:25,707 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:14:25,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 05:14:25,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:25,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:25,707 INFO L85 PathProgramCache]: Analyzing trace with hash -491468481, now seen corresponding path program 1 times [2025-02-06 05:14:25,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:25,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429532389] [2025-02-06 05:14:25,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:25,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:29,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 05:14:29,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 05:14:29,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:29,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 05:14:30,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:30,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429532389] [2025-02-06 05:14:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429532389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:30,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:30,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:14:30,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885211609] [2025-02-06 05:14:30,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:30,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:14:30,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:30,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:14:30,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:14:30,209 INFO L87 Difference]: Start difference. First operand 188 states and 235 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 05:14:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:30,650 INFO L93 Difference]: Finished difference Result 299 states and 366 transitions. [2025-02-06 05:14:30,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:14:30,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2025-02-06 05:14:30,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:30,654 INFO L225 Difference]: With dead ends: 299 [2025-02-06 05:14:30,654 INFO L226 Difference]: Without dead ends: 193 [2025-02-06 05:14:30,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:14:30,655 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 0 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:30,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 888 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 05:14:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-06 05:14:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-02-06 05:14:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 138 states have (on average 1.2318840579710144) internal successors, (170), 139 states have internal predecessors, (170), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (37), 35 states have call predecessors, (37), 34 states have call successors, (37) [2025-02-06 05:14:30,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 242 transitions. [2025-02-06 05:14:30,663 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 242 transitions. Word has length 95 [2025-02-06 05:14:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:30,664 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 242 transitions. [2025-02-06 05:14:30,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 05:14:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 242 transitions. [2025-02-06 05:14:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 05:14:30,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:30,665 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:14:30,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 05:14:30,665 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:30,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:30,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1133795076, now seen corresponding path program 1 times [2025-02-06 05:14:30,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:30,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024896058] [2025-02-06 05:14:30,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:30,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:34,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 05:14:34,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 05:14:34,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:34,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 05:14:37,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:37,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024896058] [2025-02-06 05:14:37,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024896058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:37,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:37,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 05:14:37,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199019101] [2025-02-06 05:14:37,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:37,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 05:14:37,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:37,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 05:14:37,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 05:14:37,073 INFO L87 Difference]: Start difference. First operand 193 states and 242 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 05:14:41,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:14:45,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:14:49,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:14:54,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:14:58,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:15:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:15:03,060 INFO L93 Difference]: Finished difference Result 237 states and 294 transitions. [2025-02-06 05:15:03,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 05:15:03,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2025-02-06 05:15:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:15:03,066 INFO L225 Difference]: With dead ends: 237 [2025-02-06 05:15:03,066 INFO L226 Difference]: Without dead ends: 201 [2025-02-06 05:15:03,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 05:15:03,067 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 11 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:15:03,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1233 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 5 Unknown, 0 Unchecked, 25.3s Time] [2025-02-06 05:15:03,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-06 05:15:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2025-02-06 05:15:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.232394366197183) internal successors, (175), 144 states have internal predecessors, (175), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (38), 35 states have call predecessors, (38), 34 states have call successors, (38) [2025-02-06 05:15:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 248 transitions. [2025-02-06 05:15:03,080 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 248 transitions. Word has length 101 [2025-02-06 05:15:03,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:15:03,081 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 248 transitions. [2025-02-06 05:15:03,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 05:15:03,081 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 248 transitions. [2025-02-06 05:15:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 05:15:03,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:15:03,082 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:15:03,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 05:15:03,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:15:03,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:15:03,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1330308581, now seen corresponding path program 1 times [2025-02-06 05:15:03,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:15:03,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129329759] [2025-02-06 05:15:03,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:03,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:15:06,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 05:15:06,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 05:15:06,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:06,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 05:15:08,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:15:08,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129329759] [2025-02-06 05:15:08,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129329759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:15:08,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:15:08,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:15:08,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104193177] [2025-02-06 05:15:08,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:15:08,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:15:08,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:15:08,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:15:08,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:15:08,059 INFO L87 Difference]: Start difference. First operand 198 states and 248 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 05:15:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:15:08,596 INFO L93 Difference]: Finished difference Result 244 states and 302 transitions. [2025-02-06 05:15:08,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:15:08,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2025-02-06 05:15:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:15:08,598 INFO L225 Difference]: With dead ends: 244 [2025-02-06 05:15:08,598 INFO L226 Difference]: Without dead ends: 203 [2025-02-06 05:15:08,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:15:08,599 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 5 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 05:15:08,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 665 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 05:15:08,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-06 05:15:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2025-02-06 05:15:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 143 states have (on average 1.2307692307692308) internal successors, (176), 145 states have internal predecessors, (176), 36 states have call successors, (36), 18 states have call predecessors, (36), 20 states have return successors, (39), 36 states have call predecessors, (39), 35 states have call successors, (39) [2025-02-06 05:15:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 251 transitions. [2025-02-06 05:15:08,608 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 251 transitions. Word has length 101 [2025-02-06 05:15:08,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:15:08,609 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 251 transitions. [2025-02-06 05:15:08,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 05:15:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 251 transitions. [2025-02-06 05:15:08,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 05:15:08,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:15:08,612 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:15:08,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 05:15:08,612 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:15:08,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:15:08,613 INFO L85 PathProgramCache]: Analyzing trace with hash -537175940, now seen corresponding path program 1 times [2025-02-06 05:15:08,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:15:08,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760872660] [2025-02-06 05:15:08,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:15:08,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:15:12,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 05:15:12,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 05:15:12,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:15:12,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 05:15:16,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:15:16,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760872660] [2025-02-06 05:15:16,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760872660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:15:16,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:15:16,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 05:15:16,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036222587] [2025-02-06 05:15:16,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:15:16,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 05:15:16,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:15:16,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 05:15:16,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:15:16,675 INFO L87 Difference]: Start difference. First operand 200 states and 251 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 05:15:20,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []