./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ace14697ac0820cd1cdf4cf69cd00f22476365c493527983be1f9a153e0d5b6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:13:29,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:13:29,779 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:29,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:13:29,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:13:29,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:13:29,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:13:29,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:13:29,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:13:29,810 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:13:29,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:13:29,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:13:29,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:13:29,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:13:29,812 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:13:29,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:13:29,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:13:29,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:13:29,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:13:29,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:13:29,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:13:29,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:13:29,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:13:29,813 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:13:29,813 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:13:29,813 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:13:29,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:13:29,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:13:29,814 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:13:29,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:13:29,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:13:29,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:13:29,814 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:13:29,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:13:29,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:13:29,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:13:29,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:13:29,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:13:29,815 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:13:29,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:13:29,815 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 -> ace14697ac0820cd1cdf4cf69cd00f22476365c493527983be1f9a153e0d5b6f [2025-02-06 05:13:30,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:13:30,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:13:30,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:13:30,145 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:13:30,146 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:13:30,147 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_bounded_harness_negated.i [2025-02-06 05:13:31,482 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8a80c22a/ae366dae7b8e4679baa205840bfa8233/FLAG3f50d0ea2 [2025-02-06 05:13:32,095 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:13:32,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.i [2025-02-06 05:13:32,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8a80c22a/ae366dae7b8e4679baa205840bfa8233/FLAG3f50d0ea2 [2025-02-06 05:13:32,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8a80c22a/ae366dae7b8e4679baa205840bfa8233 [2025-02-06 05:13:32,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:13:32,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:13:32,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:13:32,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:13:32,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:13:32,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:13:32" (1/1) ... [2025-02-06 05:13:32,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5f9ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:32, skipping insertion in model container [2025-02-06 05:13:32,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:13:32" (1/1) ... [2025-02-06 05:13:32,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:13:32,596 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_bounded_harness_negated.i[4501,4514] [2025-02-06 05:13:32,609 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_bounded_harness_negated.i[4561,4574] [2025-02-06 05:13:34,343 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:34,344 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:34,345 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:34,345 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:34,346 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:34,369 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:34,369 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:34,371 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:34,372 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:34,377 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:34,378 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:34,379 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:34,379 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,308 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,308 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,341 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,342 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,353 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,354 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,379 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,381 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,382 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,383 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,383 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,384 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,384 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,437 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_bounded_harness_negated.i[228071,228084] [2025-02-06 05:13:36,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:13:36,476 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:13:36,487 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_bounded_harness_negated.i[4501,4514] [2025-02-06 05:13:36,488 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_bounded_harness_negated.i[4561,4574] [2025-02-06 05:13:36,523 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,524 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,524 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,524 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,525 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,530 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,531 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,533 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,533 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,534 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,534 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,601 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7526-7537] [2025-02-06 05:13:36,721 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,722 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,731 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,731 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,735 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,735 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,746 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,746 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,748 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,748 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,748 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,749 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,749 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:36,777 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_bounded_harness_negated.i[228071,228084] [2025-02-06 05:13:36,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:13:36,990 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:13:36,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:36 WrapperNode [2025-02-06 05:13:36,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:13:36,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:13:36,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:13:36,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:13:36,999 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:36" (1/1) ... [2025-02-06 05:13:37,091 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:36" (1/1) ... [2025-02-06 05:13:37,195 INFO L138 Inliner]: procedures = 763, calls = 2426, calls flagged for inlining = 67, calls inlined = 13, statements flattened = 854 [2025-02-06 05:13:37,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:13:37,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:13:37,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:13:37,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:13:37,210 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:36" (1/1) ... [2025-02-06 05:13:37,210 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:36" (1/1) ... [2025-02-06 05:13:37,217 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:36" (1/1) ... [2025-02-06 05:13:37,230 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 05:13:37,232 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:36" (1/1) ... [2025-02-06 05:13:37,232 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:36" (1/1) ... [2025-02-06 05:13:37,282 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:36" (1/1) ... [2025-02-06 05:13:37,285 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:36" (1/1) ... [2025-02-06 05:13:37,301 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:36" (1/1) ... [2025-02-06 05:13:37,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:36" (1/1) ... [2025-02-06 05:13:37,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:13:37,316 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:13:37,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:13:37,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:13:37,322 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:36" (1/1) ... [2025-02-06 05:13:37,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:13:37,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:13:37,360 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:37,363 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:37,391 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-02-06 05:13:37,391 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-02-06 05:13:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 05:13:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 05:13:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-02-06 05:13:37,392 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-02-06 05:13:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-02-06 05:13:37,392 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-02-06 05:13:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 05:13:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-02-06 05:13:37,392 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-02-06 05:13:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 05:13:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-06 05:13:37,392 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-06 05:13:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 05:13:37,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 05:13:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 05:13:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-02-06 05:13:37,393 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-02-06 05:13:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 05:13:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:13:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-02-06 05:13:37,393 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-02-06 05:13:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 05:13:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:13:37,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:13:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-02-06 05:13:37,393 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-02-06 05:13:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-06 05:13:37,393 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-06 05:13:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 05:13:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 05:13:37,393 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 05:13:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 05:13:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-02-06 05:13:37,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-02-06 05:13:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 05:13:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-02-06 05:13:37,394 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-02-06 05:13:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 05:13:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-02-06 05:13:37,394 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-02-06 05:13:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-06 05:13:37,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-06 05:13:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-02-06 05:13:37,394 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-02-06 05:13:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-06 05:13:37,394 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-06 05:13:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 05:13:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-02-06 05:13:37,394 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-02-06 05:13:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 05:13:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-02-06 05:13:37,394 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-02-06 05:13:37,738 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:13:37,742 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:13:37,797 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9956: havoc #t~mem1489.base, #t~mem1489.offset;havoc #t~short1490;havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~ret1492;havoc #t~short1493; [2025-02-06 05:13:37,812 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-02-06 05:13:37,846 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10069: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-02-06 05:13:37,899 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6943: havoc #t~ret589#1;havoc #t~ite591#1.base, #t~ite591#1.offset;havoc #t~ret590#1.base, #t~ret590#1.offset; [2025-02-06 05:13:37,899 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6928: havoc bounded_calloc_#t~malloc587#1.base, bounded_calloc_#t~malloc587#1.offset;call ULTIMATE.dealloc(bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset);havoc bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset; [2025-02-06 05:13:38,084 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-02-06 05:13:38,084 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9151: 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:38,094 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6974: havoc #t~ret600.base, #t~ret600.offset; [2025-02-06 05:13:38,095 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-02-06 05:13:38,114 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-02-06 05:13:38,117 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-06 05:13:38,400 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6997: call ULTIMATE.dealloc(aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset);havoc aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset; [2025-02-06 05:13:38,401 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9122: 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:38,427 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-02-06 05:13:38,440 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-02-06 05:13:44,294 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9210-1: assume false; [2025-02-06 05:13:44,294 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9210-1: assume !false; [2025-02-06 05:13:44,424 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2025-02-06 05:13:44,424 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:13:44,467 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:13:44,467 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:13:44,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:13:44 BoogieIcfgContainer [2025-02-06 05:13:44,468 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:13:44,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:13:44,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:13:44,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:13:44,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:13:32" (1/3) ... [2025-02-06 05:13:44,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9da296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:13:44, skipping insertion in model container [2025-02-06 05:13:44,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:36" (2/3) ... [2025-02-06 05:13:44,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9da296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:13:44, skipping insertion in model container [2025-02-06 05:13:44,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:13:44" (3/3) ... [2025-02-06 05:13:44,480 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_bounded_harness_negated.i [2025-02-06 05:13:44,501 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:13:44,503 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_init_bounded_harness_negated.i that has 20 procedures, 207 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 05:13:44,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:13:44,585 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;@17cf8d38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:13:44,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:13:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 147 states have (on average 1.272108843537415) internal successors, (187), 148 states have internal predecessors, (187), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 05:13:44,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 05:13:44,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:13:44,605 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:13:44,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:13:44,612 INFO L85 PathProgramCache]: Analyzing trace with hash -824484463, now seen corresponding path program 1 times [2025-02-06 05:13:44,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:13:44,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074430285] [2025-02-06 05:13:44,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:13:44,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:13:51,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 05:13:51,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 05:13:51,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:13:51,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:13:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-06 05:13:52,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:13:52,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074430285] [2025-02-06 05:13:52,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074430285] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:13:52,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385476674] [2025-02-06 05:13:52,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:13:52,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:13:52,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:13:52,158 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:52,160 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:57,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 05:13:57,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 05:13:57,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:13:57,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:13:57,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 4103 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 05:13:57,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:13:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-06 05:13:57,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:13:57,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385476674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:13:57,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:13:57,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 05:13:57,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785031706] [2025-02-06 05:13:57,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:13:57,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 05:13:57,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:13:57,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 05:13:57,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:13:57,799 INFO L87 Difference]: Start difference. First operand has 207 states, 147 states have (on average 1.272108843537415) internal successors, (187), 148 states have internal predecessors, (187), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 05:13:57,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:13:57,918 INFO L93 Difference]: Finished difference Result 403 states and 538 transitions. [2025-02-06 05:13:57,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 05:13:57,921 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2025-02-06 05:13:57,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:13:57,929 INFO L225 Difference]: With dead ends: 403 [2025-02-06 05:13:57,930 INFO L226 Difference]: Without dead ends: 198 [2025-02-06 05:13:57,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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:57,940 INFO L435 NwaCegarLoop]: 253 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, 253 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:57,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 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:57,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-06 05:13:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-06 05:13:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 139 states have (on average 1.2446043165467626) internal successors, (173), 140 states have internal predecessors, (173), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 05:13:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 250 transitions. [2025-02-06 05:13:58,013 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 250 transitions. Word has length 76 [2025-02-06 05:13:58,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:13:58,015 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 250 transitions. [2025-02-06 05:13:58,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 05:13:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2025-02-06 05:13:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 05:13:58,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:13:58,020 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,038 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:58,221 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:58,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:13:58,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:13:58,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1213648750, now seen corresponding path program 1 times [2025-02-06 05:13:58,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:13:58,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376675216] [2025-02-06 05:13:58,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:13:58,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:02,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 05:14:02,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 05:14:02,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:02,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 05:14:03,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:03,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376675216] [2025-02-06 05:14:03,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376675216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:03,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:03,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:14:03,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989607799] [2025-02-06 05:14:03,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:03,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:14:03,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:03,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:14:03,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:03,993 INFO L87 Difference]: Start difference. First operand 198 states and 250 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 05:14:04,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:04,355 INFO L93 Difference]: Finished difference Result 341 states and 420 transitions. [2025-02-06 05:14:04,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:14:04,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2025-02-06 05:14:04,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:04,358 INFO L225 Difference]: With dead ends: 341 [2025-02-06 05:14:04,358 INFO L226 Difference]: Without dead ends: 200 [2025-02-06 05:14:04,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:04,360 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 0 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 718 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:04,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 718 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:04,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-06 05:14:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-02-06 05:14:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 142 states have internal predecessors, (175), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 05:14:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 252 transitions. [2025-02-06 05:14:04,377 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 252 transitions. Word has length 76 [2025-02-06 05:14:04,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:04,377 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 252 transitions. [2025-02-06 05:14:04,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 05:14:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 252 transitions. [2025-02-06 05:14:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-06 05:14:04,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:04,380 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 05:14:04,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:04,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:04,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1449552111, now seen corresponding path program 1 times [2025-02-06 05:14:04,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:04,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818153710] [2025-02-06 05:14:04,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:04,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:08,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-06 05:14:08,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 05:14:08,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:08,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 05:14:09,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:09,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818153710] [2025-02-06 05:14:09,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818153710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:09,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:09,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:14:09,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842508781] [2025-02-06 05:14:09,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:09,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:14:09,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:09,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:14:09,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:09,633 INFO L87 Difference]: Start difference. First operand 200 states and 252 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 05:14:09,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:09,927 INFO L93 Difference]: Finished difference Result 252 states and 310 transitions. [2025-02-06 05:14:09,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:14:09,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 78 [2025-02-06 05:14:09,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:09,931 INFO L225 Difference]: With dead ends: 252 [2025-02-06 05:14:09,932 INFO L226 Difference]: Without dead ends: 204 [2025-02-06 05:14:09,932 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:09,933 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 0 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 718 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:09,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 718 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:09,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-06 05:14:09,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-02-06 05:14:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 144 states have (on average 1.2361111111111112) internal successors, (178), 145 states have internal predecessors, (178), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2025-02-06 05:14:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 256 transitions. [2025-02-06 05:14:09,957 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 256 transitions. Word has length 78 [2025-02-06 05:14:09,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:09,958 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 256 transitions. [2025-02-06 05:14:09,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 05:14:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 256 transitions. [2025-02-06 05:14:09,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 05:14:09,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:09,961 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 05:14:09,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:09,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:09,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1216540269, now seen corresponding path program 1 times [2025-02-06 05:14:09,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:09,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587831178] [2025-02-06 05:14:09,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:09,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:13,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 05:14:13,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 05:14:13,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:13,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 05:14:14,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:14,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587831178] [2025-02-06 05:14:14,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587831178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:14,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:14,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:14:14,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070489161] [2025-02-06 05:14:14,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:14,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:14:14,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:14,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:14:14,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:14,562 INFO L87 Difference]: Start difference. First operand 204 states and 256 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 05:14:15,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:15,033 INFO L93 Difference]: Finished difference Result 252 states and 309 transitions. [2025-02-06 05:14:15,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:14:15,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-02-06 05:14:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:15,036 INFO L225 Difference]: With dead ends: 252 [2025-02-06 05:14:15,036 INFO L226 Difference]: Without dead ends: 204 [2025-02-06 05:14:15,037 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:15,037 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 720 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.5s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:15,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 720 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 05:14:15,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-06 05:14:15,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2025-02-06 05:14:15,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 141 states have (on average 1.2269503546099292) internal successors, (173), 142 states have internal predecessors, (173), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 05:14:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 250 transitions. [2025-02-06 05:14:15,058 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 250 transitions. Word has length 83 [2025-02-06 05:14:15,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:15,058 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 250 transitions. [2025-02-06 05:14:15,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 05:14:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 250 transitions. [2025-02-06 05:14:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 05:14:15,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:15,063 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 05:14:15,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:15,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:15,064 INFO L85 PathProgramCache]: Analyzing trace with hash 580601981, now seen corresponding path program 1 times [2025-02-06 05:14:15,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:15,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278940296] [2025-02-06 05:14:15,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:15,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:18,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 05:14:18,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 05:14:18,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:18,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 05:14:20,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:20,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278940296] [2025-02-06 05:14:20,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278940296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:20,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:20,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:14:20,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291256946] [2025-02-06 05:14:20,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:20,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:14:20,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:20,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:14:20,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:14:20,040 INFO L87 Difference]: Start difference. First operand 200 states and 250 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 05:14:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:20,520 INFO L93 Difference]: Finished difference Result 321 states and 393 transitions. [2025-02-06 05:14:20,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:14:20,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 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:20,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:20,524 INFO L225 Difference]: With dead ends: 321 [2025-02-06 05:14:20,524 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 05:14:20,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:14:20,527 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 0 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 948 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:20,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 948 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:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 05:14:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-02-06 05:14:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 145 states have (on average 1.2206896551724138) internal successors, (177), 146 states have internal predecessors, (177), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (41), 39 states have call predecessors, (41), 38 states have call successors, (41) [2025-02-06 05:14:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 257 transitions. [2025-02-06 05:14:20,546 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 257 transitions. Word has length 101 [2025-02-06 05:14:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:20,546 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 257 transitions. [2025-02-06 05:14:20,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 05:14:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 257 transitions. [2025-02-06 05:14:20,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 05:14:20,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:20,549 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 05:14:20,550 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:20,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:20,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1941583039, now seen corresponding path program 1 times [2025-02-06 05:14:20,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:20,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264262812] [2025-02-06 05:14:20,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:20,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:24,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 05:14:24,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 05:14:24,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:24,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 05:14:27,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:27,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264262812] [2025-02-06 05:14:27,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264262812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:27,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:27,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:14:27,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561284318] [2025-02-06 05:14:27,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:27,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:14:27,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:27,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:14:27,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:14:27,211 INFO L87 Difference]: Start difference. First operand 205 states and 257 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 05:14:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:27,658 INFO L93 Difference]: Finished difference Result 261 states and 320 transitions. [2025-02-06 05:14:27,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:14:27,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2025-02-06 05:14:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:27,661 INFO L225 Difference]: With dead ends: 261 [2025-02-06 05:14:27,661 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 05:14:27,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:14:27,662 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 0 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:27,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 952 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 05:14:27,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 05:14:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-02-06 05:14:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 145 states have (on average 1.206896551724138) internal successors, (175), 146 states have internal predecessors, (175), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (41), 39 states have call predecessors, (41), 38 states have call successors, (41) [2025-02-06 05:14:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 255 transitions. [2025-02-06 05:14:27,672 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 255 transitions. Word has length 107 [2025-02-06 05:14:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:27,672 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 255 transitions. [2025-02-06 05:14:27,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 05:14:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 255 transitions. [2025-02-06 05:14:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 05:14:27,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:27,674 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:14:27,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 05:14:27,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:27,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:27,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1102581284, now seen corresponding path program 1 times [2025-02-06 05:14:27,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:27,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932365408] [2025-02-06 05:14:27,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:27,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:31,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 05:14:31,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 05:14:31,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:31,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-02-06 05:14:32,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:32,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932365408] [2025-02-06 05:14:32,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932365408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:32,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:32,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:14:32,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621672809] [2025-02-06 05:14:32,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:32,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:14:32,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:32,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:14:32,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:32,152 INFO L87 Difference]: Start difference. First operand 205 states and 255 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 05:14:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:32,458 INFO L93 Difference]: Finished difference Result 324 states and 392 transitions. [2025-02-06 05:14:32,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:14:32,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 142 [2025-02-06 05:14:32,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:32,461 INFO L225 Difference]: With dead ends: 324 [2025-02-06 05:14:32,461 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 05:14:32,462 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:32,462 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 0 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:32,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 710 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 05:14:32,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 05:14:32,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2025-02-06 05:14:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 141 states have (on average 1.198581560283688) internal successors, (169), 142 states have internal predecessors, (169), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 05:14:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 246 transitions. [2025-02-06 05:14:32,476 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 246 transitions. Word has length 142 [2025-02-06 05:14:32,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:32,477 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 246 transitions. [2025-02-06 05:14:32,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 05:14:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 246 transitions. [2025-02-06 05:14:32,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 05:14:32,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:32,480 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:14:32,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 05:14:32,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:32,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:32,481 INFO L85 PathProgramCache]: Analyzing trace with hash 167062751, now seen corresponding path program 1 times [2025-02-06 05:14:32,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:32,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861520839] [2025-02-06 05:14:32,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:32,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:36,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 05:14:36,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 05:14:36,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:36,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-02-06 05:14:37,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:37,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861520839] [2025-02-06 05:14:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861520839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:37,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:37,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:14:37,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267278532] [2025-02-06 05:14:37,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:37,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:14:37,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:37,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:14:37,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:14:37,441 INFO L87 Difference]: Start difference. First operand 200 states and 246 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-06 05:14:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:38,053 INFO L93 Difference]: Finished difference Result 263 states and 319 transitions. [2025-02-06 05:14:38,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:14:38,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 148 [2025-02-06 05:14:38,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:38,055 INFO L225 Difference]: With dead ends: 263 [2025-02-06 05:14:38,055 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 05:14:38,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:14:38,056 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:38,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 930 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 05:14:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 05:14:38,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-02-06 05:14:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 145 states have (on average 1.193103448275862) internal successors, (173), 146 states have internal predecessors, (173), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (41), 39 states have call predecessors, (41), 38 states have call successors, (41) [2025-02-06 05:14:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 253 transitions. [2025-02-06 05:14:38,071 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 253 transitions. Word has length 148 [2025-02-06 05:14:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:38,071 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 253 transitions. [2025-02-06 05:14:38,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-06 05:14:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 253 transitions. [2025-02-06 05:14:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 05:14:38,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:38,076 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:14:38,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 05:14:38,076 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:38,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:38,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1711635617, now seen corresponding path program 1 times [2025-02-06 05:14:38,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:38,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109315741] [2025-02-06 05:14:38,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:38,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:41,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 05:14:41,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 05:14:41,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:41,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-02-06 05:14:42,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:42,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109315741] [2025-02-06 05:14:42,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109315741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:42,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:42,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:14:42,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701412543] [2025-02-06 05:14:42,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:42,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:14:42,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:42,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:14:42,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:43,000 INFO L87 Difference]: Start difference. First operand 205 states and 253 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 05:14:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:43,461 INFO L93 Difference]: Finished difference Result 263 states and 318 transitions. [2025-02-06 05:14:43,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:14:43,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 154 [2025-02-06 05:14:43,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:43,465 INFO L225 Difference]: With dead ends: 263 [2025-02-06 05:14:43,465 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 05:14:43,465 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:43,466 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:43,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 705 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 05:14:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 05:14:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2025-02-06 05:14:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 141 states have (on average 1.1914893617021276) internal successors, (168), 142 states have internal predecessors, (168), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 05:14:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 245 transitions. [2025-02-06 05:14:43,477 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 245 transitions. Word has length 154 [2025-02-06 05:14:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:43,478 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 245 transitions. [2025-02-06 05:14:43,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 05:14:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 245 transitions. [2025-02-06 05:14:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-06 05:14:43,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:43,481 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:14:43,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 05:14:43,481 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:43,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:43,482 INFO L85 PathProgramCache]: Analyzing trace with hash 618220189, now seen corresponding path program 1 times [2025-02-06 05:14:43,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:43,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192662222] [2025-02-06 05:14:43,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:43,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:47,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 05:14:47,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 05:14:47,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:47,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-02-06 05:14:48,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:48,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192662222] [2025-02-06 05:14:48,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192662222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:48,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:48,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 05:14:48,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800045520] [2025-02-06 05:14:48,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:48,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 05:14:48,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:48,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 05:14:48,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 05:14:48,638 INFO L87 Difference]: Start difference. First operand 200 states and 245 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 05:14:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:49,229 INFO L93 Difference]: Finished difference Result 265 states and 318 transitions. [2025-02-06 05:14:49,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 05:14:49,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2025-02-06 05:14:49,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:49,231 INFO L225 Difference]: With dead ends: 265 [2025-02-06 05:14:49,232 INFO L226 Difference]: Without dead ends: 206 [2025-02-06 05:14:49,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 05:14:49,232 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 2 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:49,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1151 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 05:14:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-06 05:14:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2025-02-06 05:14:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 145 states have (on average 1.186206896551724) internal successors, (172), 146 states have internal predecessors, (172), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2025-02-06 05:14:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 250 transitions. [2025-02-06 05:14:49,241 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 250 transitions. Word has length 161 [2025-02-06 05:14:49,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:49,241 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 250 transitions. [2025-02-06 05:14:49,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 05:14:49,242 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 250 transitions. [2025-02-06 05:14:49,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-06 05:14:49,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:49,243 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:14:49,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 05:14:49,244 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:49,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:49,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1086599922, now seen corresponding path program 1 times [2025-02-06 05:14:49,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:49,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390949989] [2025-02-06 05:14:49,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:49,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms