./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.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.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 c061a12cbc38eba33828b4010e38aa9d2f9e1471733e9a6b829e0f771d8d2fcd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:13:35,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:13:35,699 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:35,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:13:35,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:13:35,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:13:35,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:13:35,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:13:35,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:13:35,728 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:13:35,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:13:35,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:13:35,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:13:35,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:13:35,728 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:13:35,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:13:35,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:13:35,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:13:35,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:13:35,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:13:35,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:13:35,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:13:35,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:13:35,733 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:13:35,733 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:13:35,733 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:13:35,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:13:35,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:13:35,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:13:35,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:13:35,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:13:35,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:13:35,733 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:13:35,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:13:35,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:13:35,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:13:35,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:13:35,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:13:35,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:13:35,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:13:35,734 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 -> c061a12cbc38eba33828b4010e38aa9d2f9e1471733e9a6b829e0f771d8d2fcd [2025-02-06 05:13:35,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:13:35,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:13:35,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:13:35,992 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:13:35,992 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:13:35,993 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.i [2025-02-06 05:13:37,254 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9684b29d7/2a3045cfb2e24a1c85717f41c7e2ac80/FLAG4edd68fae [2025-02-06 05:13:37,817 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:13:37,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i [2025-02-06 05:13:37,860 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9684b29d7/2a3045cfb2e24a1c85717f41c7e2ac80/FLAG4edd68fae [2025-02-06 05:13:37,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9684b29d7/2a3045cfb2e24a1c85717f41c7e2ac80 [2025-02-06 05:13:37,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:13:37,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:13:37,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:13:37,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:13:37,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:13:37,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:13:37" (1/1) ... [2025-02-06 05:13:37,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b91a4eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:37, skipping insertion in model container [2025-02-06 05:13:37,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:13:37" (1/1) ... [2025-02-06 05:13:37,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:13:38,172 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.i[4503,4516] [2025-02-06 05:13:38,181 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.i[4563,4576] [2025-02-06 05:13:38,713 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:38,714 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:38,714 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:38,714 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:38,715 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:38,724 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:38,724 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:38,725 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:38,725 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:38,726 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:38,727 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:38,727 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:38,727 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,533 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,533 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,562 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,562 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,572 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,573 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,593 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,594 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,595 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,595 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,595 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,595 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,596 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,653 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.i[227916,227929] [2025-02-06 05:13:39,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:13:39,684 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:13:39,694 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.i[4503,4516] [2025-02-06 05:13:39,696 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.i[4563,4576] [2025-02-06 05:13:39,741 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,744 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,745 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,745 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,746 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,749 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,752 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,753 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,753 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,753 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,754 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,755 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,755 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,824 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7576-7587] [2025-02-06 05:13:39,889 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,890 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,896 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,896 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,899 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,900 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,909 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,909 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,909 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,910 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,910 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,910 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,910 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:39,927 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.i[227916,227929] [2025-02-06 05:13:39,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:13:40,106 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:13:40,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:40 WrapperNode [2025-02-06 05:13:40,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:13:40,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:13:40,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:13:40,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:13:40,116 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:40" (1/1) ... [2025-02-06 05:13:40,188 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:40" (1/1) ... [2025-02-06 05:13:40,243 INFO L138 Inliner]: procedures = 764, calls = 2425, calls flagged for inlining = 66, calls inlined = 11, statements flattened = 831 [2025-02-06 05:13:40,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:13:40,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:13:40,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:13:40,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:13:40,252 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:40" (1/1) ... [2025-02-06 05:13:40,252 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:40" (1/1) ... [2025-02-06 05:13:40,256 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:40" (1/1) ... [2025-02-06 05:13:40,263 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 05:13:40,263 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:40" (1/1) ... [2025-02-06 05:13:40,263 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:40" (1/1) ... [2025-02-06 05:13:40,287 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:40" (1/1) ... [2025-02-06 05:13:40,292 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:40" (1/1) ... [2025-02-06 05:13:40,303 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:40" (1/1) ... [2025-02-06 05:13:40,305 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:40" (1/1) ... [2025-02-06 05:13:40,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:13:40,318 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:13:40,318 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:13:40,318 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:13:40,319 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:40" (1/1) ... [2025-02-06 05:13:40,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:13:40,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:13:40,347 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:40,350 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:40,365 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-02-06 05:13:40,366 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-02-06 05:13:40,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 05:13:40,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 05:13:40,366 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-02-06 05:13:40,366 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-02-06 05:13:40,366 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-02-06 05:13:40,367 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-02-06 05:13:40,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 05:13:40,367 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-02-06 05:13:40,367 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-02-06 05:13:40,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 05:13:40,367 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-06 05:13:40,367 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-06 05:13:40,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 05:13:40,367 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 05:13:40,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 05:13:40,367 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-02-06 05:13:40,368 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-02-06 05:13:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 05:13:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:13:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-02-06 05:13:40,368 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-02-06 05:13:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 05:13:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:13:40,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:13:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-02-06 05:13:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-02-06 05:13:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-06 05:13:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-06 05:13:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 05:13:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 05:13:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 05:13:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 05:13:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-02-06 05:13:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-02-06 05:13:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 05:13:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-02-06 05:13:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-02-06 05:13:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 05:13:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-02-06 05:13:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-02-06 05:13:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-06 05:13:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-06 05:13:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-02-06 05:13:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-02-06 05:13:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 05:13:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-02-06 05:13:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-02-06 05:13:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 05:13:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-02-06 05:13:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-02-06 05:13:40,605 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:13:40,607 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:13:40,648 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10008: 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:40,655 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-02-06 05:13:40,680 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10121: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-02-06 05:13:40,715 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6940: 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:40,716 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6955: 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:40,836 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-02-06 05:13:40,836 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9201: 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:40,839 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6986: havoc #t~ret600.base, #t~ret600.offset; [2025-02-06 05:13:40,844 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-02-06 05:13:40,856 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-02-06 05:13:40,987 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7009: 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:40,988 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9172: 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:41,007 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-02-06 05:13:41,017 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-02-06 05:13:46,460 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9260-1: assume false; [2025-02-06 05:13:46,461 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9260-1: assume !false; [2025-02-06 05:13:46,549 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2025-02-06 05:13:46,549 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:13:46,577 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:13:46,577 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:13:46,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:13:46 BoogieIcfgContainer [2025-02-06 05:13:46,577 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:13:46,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:13:46,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:13:46,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:13:46,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:13:37" (1/3) ... [2025-02-06 05:13:46,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0e49d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:13:46, skipping insertion in model container [2025-02-06 05:13:46,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:40" (2/3) ... [2025-02-06 05:13:46,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0e49d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:13:46, skipping insertion in model container [2025-02-06 05:13:46,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:13:46" (3/3) ... [2025-02-06 05:13:46,590 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_unbounded_harness.i [2025-02-06 05:13:46,601 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:13:46,605 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_init_unbounded_harness.i that has 19 procedures, 193 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 05:13:46,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:13:46,663 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;@11ea0117, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:13:46,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:13:46,668 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:13:46,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 05:13:46,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:13:46,677 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:13:46,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:13:46,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:13:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1522933011, now seen corresponding path program 1 times [2025-02-06 05:13:46,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:13:46,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128753108] [2025-02-06 05:13:46,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:13:46,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:13:50,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:13:51,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:13:51,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:13:51,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:13:51,469 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:13:51,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:13:51,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128753108] [2025-02-06 05:13:51,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128753108] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:13:51,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40716055] [2025-02-06 05:13:51,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:13:51,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:13:51,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:13:51,473 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:13:51,474 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:13:55,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:13:55,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:13:55,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:13:55,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:13:55,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 4093 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 05:13:55,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:13:56,000 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:13:56,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:13:56,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40716055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:13:56,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:13:56,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 05:13:56,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626111763] [2025-02-06 05:13:56,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:13:56,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 05:13:56,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:13:56,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 05:13:56,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:13:56,020 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:13:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:13:56,129 INFO L93 Difference]: Finished difference Result 375 states and 499 transitions. [2025-02-06 05:13:56,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 05:13:56,134 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:13:56,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:13:56,139 INFO L225 Difference]: With dead ends: 375 [2025-02-06 05:13:56,139 INFO L226 Difference]: Without dead ends: 186 [2025-02-06 05:13:56,143 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:13:56,145 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:13:56,145 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:13:56,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-06 05:13:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-02-06 05:13:56,176 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:13:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 235 transitions. [2025-02-06 05:13:56,182 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 235 transitions. Word has length 70 [2025-02-06 05:13:56,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:13:56,183 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 235 transitions. [2025-02-06 05:13:56,183 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:13:56,183 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 235 transitions. [2025-02-06 05:13:56,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 05:13:56,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:13:56,187 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:13:56,202 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:13:56,387 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:13:56,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:13:56,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:13:56,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1971919573, now seen corresponding path program 1 times [2025-02-06 05:13:56,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:13:56,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141738323] [2025-02-06 05:13:56,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:13:56,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:00,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 05:14:00,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 05:14:00,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:00,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:01,082 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:01,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:01,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141738323] [2025-02-06 05:14:01,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141738323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:01,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:01,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:14:01,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348127314] [2025-02-06 05:14:01,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:01,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:14:01,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:01,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:14:01,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:01,084 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:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:01,413 INFO L93 Difference]: Finished difference Result 319 states and 393 transitions. [2025-02-06 05:14:01,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:14:01,413 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:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:01,415 INFO L225 Difference]: With dead ends: 319 [2025-02-06 05:14:01,416 INFO L226 Difference]: Without dead ends: 188 [2025-02-06 05:14:01,417 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:01,417 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:01,418 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:01,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-06 05:14:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-02-06 05:14:01,426 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:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 237 transitions. [2025-02-06 05:14:01,428 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 237 transitions. Word has length 70 [2025-02-06 05:14:01,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:01,428 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 237 transitions. [2025-02-06 05:14:01,428 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:01,428 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 237 transitions. [2025-02-06 05:14:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 05:14:01,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:01,431 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:01,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 05:14:01,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:01,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:01,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1325313108, now seen corresponding path program 1 times [2025-02-06 05:14:01,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:01,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604126766] [2025-02-06 05:14:01,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:01,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:05,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 05:14:05,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 05:14:05,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:05,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:05,920 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:05,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:05,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604126766] [2025-02-06 05:14:05,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604126766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:05,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:05,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:14:05,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171873750] [2025-02-06 05:14:05,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:05,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:14:05,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:05,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:14:05,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:05,923 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:06,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:06,216 INFO L93 Difference]: Finished difference Result 226 states and 280 transitions. [2025-02-06 05:14:06,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:14:06,217 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:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:06,219 INFO L225 Difference]: With dead ends: 226 [2025-02-06 05:14:06,219 INFO L226 Difference]: Without dead ends: 192 [2025-02-06 05:14:06,219 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:06,219 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:06,220 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:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-06 05:14:06,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-02-06 05:14:06,232 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:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 241 transitions. [2025-02-06 05:14:06,234 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 241 transitions. Word has length 72 [2025-02-06 05:14:06,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:06,235 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 241 transitions. [2025-02-06 05:14:06,235 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:06,235 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 241 transitions. [2025-02-06 05:14:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 05:14:06,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:06,238 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:06,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 05:14:06,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:06,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1050669427, now seen corresponding path program 1 times [2025-02-06 05:14:06,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:06,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578285548] [2025-02-06 05:14:06,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:06,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:09,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 05:14:09,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 05:14:09,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:09,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:10,376 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:10,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:10,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578285548] [2025-02-06 05:14:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578285548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:10,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:10,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:14:10,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745156191] [2025-02-06 05:14:10,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:10,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:14:10,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:10,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:14:10,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:10,379 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:10,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:10,671 INFO L93 Difference]: Finished difference Result 226 states and 279 transitions. [2025-02-06 05:14:10,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:14:10,672 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:10,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:10,673 INFO L225 Difference]: With dead ends: 226 [2025-02-06 05:14:10,673 INFO L226 Difference]: Without dead ends: 192 [2025-02-06 05:14:10,673 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:10,674 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:10,674 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:10,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-06 05:14:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2025-02-06 05:14:10,687 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:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 235 transitions. [2025-02-06 05:14:10,689 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 235 transitions. Word has length 77 [2025-02-06 05:14:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:10,690 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 235 transitions. [2025-02-06 05:14:10,690 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:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 235 transitions. [2025-02-06 05:14:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 05:14:10,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:10,691 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:10,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 05:14:10,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:10,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash -491468481, now seen corresponding path program 1 times [2025-02-06 05:14:10,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:10,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374192638] [2025-02-06 05:14:10,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:14,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 05:14:14,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 05:14:14,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:14,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:15,083 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,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:15,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374192638] [2025-02-06 05:14:15,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374192638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:15,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:15,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:14:15,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3535774] [2025-02-06 05:14:15,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:15,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:14:15,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:15,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:14:15,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:14:15,084 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:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:15,553 INFO L93 Difference]: Finished difference Result 299 states and 366 transitions. [2025-02-06 05:14:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:14:15,555 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:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:15,557 INFO L225 Difference]: With dead ends: 299 [2025-02-06 05:14:15,557 INFO L226 Difference]: Without dead ends: 193 [2025-02-06 05:14:15,558 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:15,558 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.5s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:15,559 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.5s Time] [2025-02-06 05:14:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-06 05:14:15,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-02-06 05:14:15,569 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:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 242 transitions. [2025-02-06 05:14:15,570 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 242 transitions. Word has length 95 [2025-02-06 05:14:15,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:15,570 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 242 transitions. [2025-02-06 05:14:15,572 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:15,573 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 242 transitions. [2025-02-06 05:14:15,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 05:14:15,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:15,574 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:15,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 05:14:15,574 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:15,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1133795076, now seen corresponding path program 1 times [2025-02-06 05:14:15,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:15,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481151990] [2025-02-06 05:14:15,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:15,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:19,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 05:14:19,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 05:14:19,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:19,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:21,956 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:21,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:21,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481151990] [2025-02-06 05:14:21,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481151990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:21,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:21,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 05:14:21,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814004433] [2025-02-06 05:14:21,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:21,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 05:14:21,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:21,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 05:14:21,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 05:14:21,958 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:26,018 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:30,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:14:34,811 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:39,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:14:43,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:14:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:47,523 INFO L93 Difference]: Finished difference Result 237 states and 294 transitions. [2025-02-06 05:14:47,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 05:14:47,529 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:14:47,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:47,531 INFO L225 Difference]: With dead ends: 237 [2025-02-06 05:14:47,531 INFO L226 Difference]: Without dead ends: 201 [2025-02-06 05:14:47,531 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:14:47,531 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 11 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s 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, 24.9s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:47,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1233 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 5 Unknown, 0 Unchecked, 24.9s Time] [2025-02-06 05:14:47,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-06 05:14:47,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2025-02-06 05:14:47,538 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:14:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 248 transitions. [2025-02-06 05:14:47,539 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 248 transitions. Word has length 101 [2025-02-06 05:14:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:47,539 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 248 transitions. [2025-02-06 05:14:47,540 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:14:47,540 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 248 transitions. [2025-02-06 05:14:47,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 05:14:47,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:47,541 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:47,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 05:14:47,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:47,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:47,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1330308581, now seen corresponding path program 1 times [2025-02-06 05:14:47,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:47,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365685197] [2025-02-06 05:14:47,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:47,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:51,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 05:14:51,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 05:14:51,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:51,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:52,342 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:52,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:52,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365685197] [2025-02-06 05:14:52,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365685197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:52,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:52,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:14:52,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698826532] [2025-02-06 05:14:52,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:52,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:14:52,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:52,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:14:52,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:14:52,343 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:14:52,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:52,940 INFO L93 Difference]: Finished difference Result 244 states and 302 transitions. [2025-02-06 05:14:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:14:52,944 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:14:52,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:52,946 INFO L225 Difference]: With dead ends: 244 [2025-02-06 05:14:52,946 INFO L226 Difference]: Without dead ends: 203 [2025-02-06 05:14:52,946 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:14:52,946 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 5 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:52,946 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.6s Time] [2025-02-06 05:14:52,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-06 05:14:52,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2025-02-06 05:14:52,956 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:14:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 251 transitions. [2025-02-06 05:14:52,957 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 251 transitions. Word has length 101 [2025-02-06 05:14:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:52,958 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 251 transitions. [2025-02-06 05:14:52,958 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:14:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 251 transitions. [2025-02-06 05:14:52,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 05:14:52,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:52,959 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:14:52,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 05:14:52,959 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:52,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:52,960 INFO L85 PathProgramCache]: Analyzing trace with hash -537175940, now seen corresponding path program 1 times [2025-02-06 05:14:52,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:52,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142869835] [2025-02-06 05:14:52,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:52,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:56,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 05:14:56,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 05:14:56,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:56,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:15:01,069 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:01,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:15:01,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142869835] [2025-02-06 05:15:01,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142869835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:15:01,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:15:01,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 05:15:01,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214674553] [2025-02-06 05:15:01,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:15:01,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 05:15:01,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:15:01,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 05:15:01,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:15:01,070 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:05,119 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 []