./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 658cf0e5cfa8ff565239cc21b84be4a008587cc5aba3b9c9a0b23efea938ab87 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:13:25,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:13:25,907 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:25,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:13:25,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:13:25,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:13:25,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:13:25,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:13:25,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:13:25,948 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:13:25,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:13:25,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:13:25,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:13:25,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:13:25,949 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:13:25,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:13:25,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:13:25,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:13:25,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:13:25,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:13:25,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:13:25,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:13:25,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:13:25,950 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:13:25,950 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:13:25,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:13:25,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:13:25,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:13:25,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:13:25,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:13:25,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:13:25,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:13:25,951 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:13:25,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:13:25,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:13:25,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:13:25,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:13:25,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:13:25,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:13:25,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:13:25,952 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 -> 658cf0e5cfa8ff565239cc21b84be4a008587cc5aba3b9c9a0b23efea938ab87 [2025-02-06 05:13:26,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:13:26,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:13:26,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:13:26,215 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:13:26,215 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:13:26,217 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.i [2025-02-06 05:13:27,631 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46b9576b7/9ba904886614479a9a37cbb97b28515c/FLAG8f6fccc49 [2025-02-06 05:13:28,364 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:13:28,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness.i [2025-02-06 05:13:28,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46b9576b7/9ba904886614479a9a37cbb97b28515c/FLAG8f6fccc49 [2025-02-06 05:13:28,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46b9576b7/9ba904886614479a9a37cbb97b28515c [2025-02-06 05:13:28,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:13:28,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:13:28,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:13:28,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:13:28,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:13:28,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:13:28" (1/1) ... [2025-02-06 05:13:28,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b30b999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:28, skipping insertion in model container [2025-02-06 05:13:28,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:13:28" (1/1) ... [2025-02-06 05:13:28,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:13:28,907 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.i[4501,4514] [2025-02-06 05:13:28,921 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.i[4561,4574] [2025-02-06 05:13:29,969 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:29,972 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:29,973 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:29,974 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:29,975 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:29,985 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:29,986 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:29,987 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:29,988 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:29,989 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:29,990 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:29,990 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:29,990 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:30,881 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:30,881 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:30,924 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:30,925 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:30,933 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:30,935 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:30,957 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:30,959 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:30,960 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:30,960 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:30,960 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:30,961 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:30,961 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,039 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.i[227778,227791] [2025-02-06 05:13:31,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:13:31,081 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:13:31,095 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.i[4501,4514] [2025-02-06 05:13:31,095 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.i[4561,4574] [2025-02-06 05:13:31,134 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,135 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,136 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,137 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,138 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,147 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,148 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,149 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,149 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,150 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,150 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,150 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,150 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,213 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7558-7569] [2025-02-06 05:13:31,274 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,275 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,281 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,282 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,284 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,284 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,294 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,295 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,295 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,296 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,296 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,297 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,298 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:13:31,315 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.i[227778,227791] [2025-02-06 05:13:31,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:13:31,558 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:13:31,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:31 WrapperNode [2025-02-06 05:13:31,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:13:31,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:13:31,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:13:31,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:13:31,566 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:31" (1/1) ... [2025-02-06 05:13:31,658 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:31" (1/1) ... [2025-02-06 05:13:31,750 INFO L138 Inliner]: procedures = 763, calls = 2426, calls flagged for inlining = 67, calls inlined = 13, statements flattened = 854 [2025-02-06 05:13:31,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:13:31,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:13:31,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:13:31,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:13:31,762 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:31" (1/1) ... [2025-02-06 05:13:31,763 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:31" (1/1) ... [2025-02-06 05:13:31,770 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:31" (1/1) ... [2025-02-06 05:13:31,782 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 05:13:31,782 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:31" (1/1) ... [2025-02-06 05:13:31,782 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:31" (1/1) ... [2025-02-06 05:13:31,830 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:31" (1/1) ... [2025-02-06 05:13:31,837 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:31" (1/1) ... [2025-02-06 05:13:31,848 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:31" (1/1) ... [2025-02-06 05:13:31,852 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:31" (1/1) ... [2025-02-06 05:13:31,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:13:31,867 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:13:31,867 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:13:31,867 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:13:31,871 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:31" (1/1) ... [2025-02-06 05:13:31,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:13:31,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:13:31,903 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:31,906 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:31,929 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-02-06 05:13:31,929 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-02-06 05:13:31,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 05:13:31,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 05:13:31,929 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-02-06 05:13:31,929 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-02-06 05:13:31,929 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-02-06 05:13:31,929 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-02-06 05:13:31,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 05:13:31,929 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-02-06 05:13:31,929 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-02-06 05:13:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 05:13:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-06 05:13:31,930 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-06 05:13:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 05:13:31,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 05:13:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 05:13:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-02-06 05:13:31,930 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-02-06 05:13:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 05:13:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:13:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-02-06 05:13:31,930 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-02-06 05:13:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 05:13:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:13:31,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:13:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-02-06 05:13:31,930 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-02-06 05:13:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-06 05:13:31,930 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-06 05:13:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 05:13:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 05:13:31,930 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 05:13:31,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 05:13:31,932 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-02-06 05:13:31,932 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-02-06 05:13:31,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 05:13:31,932 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-02-06 05:13:31,933 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-02-06 05:13:31,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 05:13:31,933 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-02-06 05:13:31,933 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-02-06 05:13:31,933 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-06 05:13:31,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-06 05:13:31,933 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-02-06 05:13:31,934 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-02-06 05:13:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-06 05:13:31,934 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-06 05:13:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 05:13:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-02-06 05:13:31,934 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-02-06 05:13:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 05:13:31,935 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-02-06 05:13:31,936 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-02-06 05:13:32,242 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:13:32,244 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:13:32,292 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9990: 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:32,299 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-02-06 05:13:32,319 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10103: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-02-06 05:13:32,369 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6940: havoc bounded_calloc_#t~malloc587#1.base, bounded_calloc_#t~malloc587#1.offset;call ULTIMATE.dealloc(bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset);havoc bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset; [2025-02-06 05:13:32,369 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6955: havoc #t~ret589#1;havoc #t~ite591#1.base, #t~ite591#1.offset;havoc #t~ret590#1.base, #t~ret590#1.offset; [2025-02-06 05:13:32,526 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9183: 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:32,527 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-02-06 05:13:32,538 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6986: havoc #t~ret600.base, #t~ret600.offset; [2025-02-06 05:13:32,542 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-02-06 05:13:32,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-02-06 05:13:32,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-06 05:13:32,735 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7009: call ULTIMATE.dealloc(aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset);havoc aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset; [2025-02-06 05:13:32,735 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9154: 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:32,765 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-02-06 05:13:32,801 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-02-06 05:13:38,648 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9242-1: assume false; [2025-02-06 05:13:38,649 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9242-1: assume !false; [2025-02-06 05:13:38,772 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2025-02-06 05:13:38,773 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:13:38,808 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:13:38,810 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:13:38,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:13:38 BoogieIcfgContainer [2025-02-06 05:13:38,810 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:13:38,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:13:38,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:13:38,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:13:38,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:13:28" (1/3) ... [2025-02-06 05:13:38,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1422fe7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:13:38, skipping insertion in model container [2025-02-06 05:13:38,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:13:31" (2/3) ... [2025-02-06 05:13:38,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1422fe7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:13:38, skipping insertion in model container [2025-02-06 05:13:38,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:13:38" (3/3) ... [2025-02-06 05:13:38,822 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_bounded_harness.i [2025-02-06 05:13:38,838 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:13:38,844 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_init_bounded_harness.i that has 20 procedures, 207 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 05:13:38,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:13:38,918 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;@ebc397e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:13:38,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:13:38,925 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:38,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 05:13:38,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:13:38,936 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:38,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:13:38,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:13:38,943 INFO L85 PathProgramCache]: Analyzing trace with hash -824484463, now seen corresponding path program 1 times [2025-02-06 05:13:38,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:13:38,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47226749] [2025-02-06 05:13:38,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:13:38,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:13:43,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 05:13:44,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 05:13:44,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:13:44,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:13:44,600 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:44,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:13:44,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47226749] [2025-02-06 05:13:44,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47226749] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:13:44,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599531418] [2025-02-06 05:13:44,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:13:44,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:13:44,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:13:44,606 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:44,609 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:49,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 05:13:49,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 05:13:49,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:13:49,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:13:49,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 4103 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 05:13:49,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:13:49,949 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:49,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:13:49,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599531418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:13:49,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:13:49,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 05:13:49,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260948607] [2025-02-06 05:13:49,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:13:49,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 05:13:49,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:13:49,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 05:13:49,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:13:49,977 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:50,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:13:50,111 INFO L93 Difference]: Finished difference Result 403 states and 538 transitions. [2025-02-06 05:13:50,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 05:13:50,114 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:50,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:13:50,121 INFO L225 Difference]: With dead ends: 403 [2025-02-06 05:13:50,121 INFO L226 Difference]: Without dead ends: 198 [2025-02-06 05:13:50,126 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:50,131 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:50,134 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:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-06 05:13:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-06 05:13:50,187 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:50,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 250 transitions. [2025-02-06 05:13:50,197 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 250 transitions. Word has length 76 [2025-02-06 05:13:50,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:13:50,200 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 250 transitions. [2025-02-06 05:13:50,200 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:50,200 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2025-02-06 05:13:50,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 05:13:50,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:13:50,203 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:50,217 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:50,404 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:50,404 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:13:50,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:13:50,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1213648750, now seen corresponding path program 1 times [2025-02-06 05:13:50,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:13:50,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328891733] [2025-02-06 05:13:50,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:13:50,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:13:54,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 05:13:54,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 05:13:54,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:13:54,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:13:55,813 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:13:55,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:13:55,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328891733] [2025-02-06 05:13:55,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328891733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:13:55,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:13:55,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:13:55,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184288872] [2025-02-06 05:13:55,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:13:55,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:13:55,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:13:55,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:13:55,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:13:55,817 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:13:56,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:13:56,158 INFO L93 Difference]: Finished difference Result 341 states and 420 transitions. [2025-02-06 05:13:56,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:13:56,159 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:13:56,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:13:56,161 INFO L225 Difference]: With dead ends: 341 [2025-02-06 05:13:56,162 INFO L226 Difference]: Without dead ends: 200 [2025-02-06 05:13:56,163 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:13:56,163 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:13:56,164 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:13:56,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-06 05:13:56,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-02-06 05:13:56,180 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:13:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 252 transitions. [2025-02-06 05:13:56,182 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 252 transitions. Word has length 76 [2025-02-06 05:13:56,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:13:56,182 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 252 transitions. [2025-02-06 05:13:56,183 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:13:56,183 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 252 transitions. [2025-02-06 05:13:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-06 05:13:56,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:13:56,184 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:13:56,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 05:13:56,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:13:56,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:13:56,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1449552111, now seen corresponding path program 1 times [2025-02-06 05:13:56,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:13:56,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389968415] [2025-02-06 05:13:56,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:13:56,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:00,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-06 05:14:00,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 05:14:00,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:00,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:01,134 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:01,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:01,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389968415] [2025-02-06 05:14:01,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389968415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:01,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:01,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:14:01,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894082900] [2025-02-06 05:14:01,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:01,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:14:01,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:01,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:14:01,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:01,137 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:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:01,455 INFO L93 Difference]: Finished difference Result 252 states and 310 transitions. [2025-02-06 05:14:01,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:14:01,456 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:01,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:01,460 INFO L225 Difference]: With dead ends: 252 [2025-02-06 05:14:01,460 INFO L226 Difference]: Without dead ends: 204 [2025-02-06 05:14:01,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:01,461 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:01,461 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:01,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-06 05:14:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-02-06 05:14:01,476 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:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 256 transitions. [2025-02-06 05:14:01,478 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 256 transitions. Word has length 78 [2025-02-06 05:14:01,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:01,478 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 256 transitions. [2025-02-06 05:14:01,478 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:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 256 transitions. [2025-02-06 05:14:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 05:14:01,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:01,480 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:01,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 05:14:01,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:01,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:01,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1216540269, now seen corresponding path program 1 times [2025-02-06 05:14:01,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:01,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825462936] [2025-02-06 05:14:01,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:01,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:05,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 05:14:05,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 05:14:05,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:05,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:06,256 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:06,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:06,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825462936] [2025-02-06 05:14:06,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825462936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:06,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:06,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:14:06,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069150146] [2025-02-06 05:14:06,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:06,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:14:06,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:06,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:14:06,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:06,258 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:06,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:06,724 INFO L93 Difference]: Finished difference Result 252 states and 309 transitions. [2025-02-06 05:14:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:14:06,725 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:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:06,727 INFO L225 Difference]: With dead ends: 252 [2025-02-06 05:14:06,727 INFO L226 Difference]: Without dead ends: 204 [2025-02-06 05:14:06,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:06,728 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.4s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:06,728 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.4s Time] [2025-02-06 05:14:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-06 05:14:06,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2025-02-06 05:14:06,745 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:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 250 transitions. [2025-02-06 05:14:06,747 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 250 transitions. Word has length 83 [2025-02-06 05:14:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:06,747 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 250 transitions. [2025-02-06 05:14:06,748 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:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 250 transitions. [2025-02-06 05:14:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 05:14:06,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:06,750 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:06,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 05:14:06,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:06,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:06,750 INFO L85 PathProgramCache]: Analyzing trace with hash 580601981, now seen corresponding path program 1 times [2025-02-06 05:14:06,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:06,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222136256] [2025-02-06 05:14:06,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:06,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:10,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 05:14:10,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 05:14:10,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:10,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:11,667 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:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222136256] [2025-02-06 05:14:11,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222136256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:11,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:11,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:14:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289054222] [2025-02-06 05:14:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:11,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:14:11,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:11,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:14:11,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:14:11,670 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:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:12,197 INFO L93 Difference]: Finished difference Result 321 states and 393 transitions. [2025-02-06 05:14:12,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:14:12,198 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:12,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:12,202 INFO L225 Difference]: With dead ends: 321 [2025-02-06 05:14:12,202 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 05:14:12,203 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:12,203 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 0 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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:12,205 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:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 05:14:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-02-06 05:14:12,218 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:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 257 transitions. [2025-02-06 05:14:12,221 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 257 transitions. Word has length 101 [2025-02-06 05:14:12,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:12,222 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 257 transitions. [2025-02-06 05:14:12,222 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:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 257 transitions. [2025-02-06 05:14:12,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 05:14:12,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:12,224 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:12,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 05:14:12,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:12,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:12,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1941583039, now seen corresponding path program 1 times [2025-02-06 05:14:12,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:12,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337896597] [2025-02-06 05:14:12,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:12,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:15,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 05:14:15,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 05:14:15,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:15,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:18,669 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:18,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:18,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337896597] [2025-02-06 05:14:18,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337896597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:18,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:18,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:14:18,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986741658] [2025-02-06 05:14:18,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:18,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:14:18,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:18,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:14:18,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:14:18,671 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:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:19,252 INFO L93 Difference]: Finished difference Result 261 states and 320 transitions. [2025-02-06 05:14:19,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:14:19,252 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:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:19,254 INFO L225 Difference]: With dead ends: 261 [2025-02-06 05:14:19,254 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 05:14:19,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:14:19,255 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 0 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:19,256 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.6s Time] [2025-02-06 05:14:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 05:14:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-02-06 05:14:19,267 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:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 255 transitions. [2025-02-06 05:14:19,270 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 255 transitions. Word has length 107 [2025-02-06 05:14:19,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:19,270 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 255 transitions. [2025-02-06 05:14:19,270 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:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 255 transitions. [2025-02-06 05:14:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 05:14:19,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:19,275 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:19,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 05:14:19,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:19,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:19,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1102581284, now seen corresponding path program 1 times [2025-02-06 05:14:19,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:19,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252524685] [2025-02-06 05:14:19,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:22,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 05:14:22,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 05:14:22,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:22,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:23,670 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:23,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:23,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252524685] [2025-02-06 05:14:23,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252524685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:23,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:23,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:14:23,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40238720] [2025-02-06 05:14:23,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:23,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:14:23,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:23,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:14:23,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:23,672 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:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:24,086 INFO L93 Difference]: Finished difference Result 324 states and 392 transitions. [2025-02-06 05:14:24,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:14:24,088 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:24,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:24,090 INFO L225 Difference]: With dead ends: 324 [2025-02-06 05:14:24,091 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 05:14:24,092 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:24,093 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 0 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:24,093 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.4s Time] [2025-02-06 05:14:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 05:14:24,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2025-02-06 05:14:24,104 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:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 246 transitions. [2025-02-06 05:14:24,107 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 246 transitions. Word has length 142 [2025-02-06 05:14:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:24,108 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 246 transitions. [2025-02-06 05:14:24,108 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:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 246 transitions. [2025-02-06 05:14:24,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 05:14:24,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:24,110 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:24,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 05:14:24,111 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:24,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:24,111 INFO L85 PathProgramCache]: Analyzing trace with hash 167062751, now seen corresponding path program 1 times [2025-02-06 05:14:24,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:24,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380749884] [2025-02-06 05:14:24,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:24,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:27,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 05:14:27,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 05:14:27,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:27,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:28,762 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:28,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:28,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380749884] [2025-02-06 05:14:28,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380749884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:28,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:28,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:14:28,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097813286] [2025-02-06 05:14:28,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:28,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:14:28,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:28,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:14:28,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:14:28,765 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:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:29,225 INFO L93 Difference]: Finished difference Result 263 states and 319 transitions. [2025-02-06 05:14:29,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:14:29,225 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:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:29,227 INFO L225 Difference]: With dead ends: 263 [2025-02-06 05:14:29,227 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 05:14:29,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:14:29,228 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:29,228 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.4s Time] [2025-02-06 05:14:29,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 05:14:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-02-06 05:14:29,238 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:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 253 transitions. [2025-02-06 05:14:29,241 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 253 transitions. Word has length 148 [2025-02-06 05:14:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:29,241 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 253 transitions. [2025-02-06 05:14:29,241 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:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 253 transitions. [2025-02-06 05:14:29,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 05:14:29,244 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:29,244 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:29,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 05:14:29,245 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:29,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:29,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1711635617, now seen corresponding path program 1 times [2025-02-06 05:14:29,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:29,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179400488] [2025-02-06 05:14:29,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:29,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:32,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 05:14:33,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 05:14:33,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:33,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:33,958 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:33,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:33,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179400488] [2025-02-06 05:14:33,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179400488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:33,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:33,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:14:33,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633717992] [2025-02-06 05:14:33,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:33,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:14:33,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:33,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:14:33,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:14:33,959 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:34,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:34,867 INFO L93 Difference]: Finished difference Result 263 states and 318 transitions. [2025-02-06 05:14:34,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:14:34,868 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:34,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:34,869 INFO L225 Difference]: With dead ends: 263 [2025-02-06 05:14:34,869 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 05:14:34,870 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:34,870 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:34,871 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.9s Time] [2025-02-06 05:14:34,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 05:14:34,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2025-02-06 05:14:34,882 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:34,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 245 transitions. [2025-02-06 05:14:34,884 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 245 transitions. Word has length 154 [2025-02-06 05:14:34,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:34,884 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 245 transitions. [2025-02-06 05:14:34,884 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:34,885 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 245 transitions. [2025-02-06 05:14:34,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-06 05:14:34,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:34,886 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:34,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 05:14:34,886 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:34,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:34,887 INFO L85 PathProgramCache]: Analyzing trace with hash 618220189, now seen corresponding path program 1 times [2025-02-06 05:14:34,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:34,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768444632] [2025-02-06 05:14:34,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:34,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:38,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 05:14:38,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 05:14:38,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:38,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:39,872 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:39,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:39,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768444632] [2025-02-06 05:14:39,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768444632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:39,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:39,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 05:14:39,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969902829] [2025-02-06 05:14:39,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:39,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 05:14:39,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:39,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 05:14:39,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 05:14:39,874 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:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:40,536 INFO L93 Difference]: Finished difference Result 265 states and 318 transitions. [2025-02-06 05:14:40,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 05:14:40,536 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:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:40,538 INFO L225 Difference]: With dead ends: 265 [2025-02-06 05:14:40,538 INFO L226 Difference]: Without dead ends: 206 [2025-02-06 05:14:40,539 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:40,539 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:40,540 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:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-06 05:14:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2025-02-06 05:14:40,548 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:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 250 transitions. [2025-02-06 05:14:40,551 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 250 transitions. Word has length 161 [2025-02-06 05:14:40,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:40,553 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 250 transitions. [2025-02-06 05:14:40,553 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:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 250 transitions. [2025-02-06 05:14:40,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-06 05:14:40,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:40,557 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:40,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 05:14:40,557 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:40,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:40,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1086599922, now seen corresponding path program 1 times [2025-02-06 05:14:40,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:40,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763247594] [2025-02-06 05:14:40,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:40,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:14:44,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 05:14:44,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 05:14:44,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:14:44,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:14:46,606 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:46,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:14:46,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763247594] [2025-02-06 05:14:46,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763247594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:14:46,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:14:46,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 05:14:46,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565760324] [2025-02-06 05:14:46,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:14:46,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 05:14:46,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:14:46,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 05:14:46,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 05:14:46,610 INFO L87 Difference]: Start difference. First operand 205 states and 250 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2025-02-06 05:14:47,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:14:47,672 INFO L93 Difference]: Finished difference Result 264 states and 316 transitions. [2025-02-06 05:14:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 05:14:47,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 167 [2025-02-06 05:14:47,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:14:47,675 INFO L225 Difference]: With dead ends: 264 [2025-02-06 05:14:47,675 INFO L226 Difference]: Without dead ends: 198 [2025-02-06 05:14:47,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 05:14:47,677 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:14:47,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1608 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 05:14:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-06 05:14:47,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-06 05:14:47,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 140 states have (on average 1.1785714285714286) internal successors, (165), 141 states have internal predecessors, (165), 38 states have call successors, (38), 19 states have call predecessors, (38), 19 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-06 05:14:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 240 transitions. [2025-02-06 05:14:47,688 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 240 transitions. Word has length 167 [2025-02-06 05:14:47,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:14:47,689 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 240 transitions. [2025-02-06 05:14:47,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2025-02-06 05:14:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 240 transitions. [2025-02-06 05:14:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-06 05:14:47,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:14:47,692 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2025-02-06 05:14:47,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 05:14:47,693 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:14:47,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:14:47,693 INFO L85 PathProgramCache]: Analyzing trace with hash -249870259, now seen corresponding path program 1 times [2025-02-06 05:14:47,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:14:47,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140783997] [2025-02-06 05:14:47,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:14:47,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms