./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7d15a327968a132f18d81dba73a48626f64398081f4d06a91fc3a4f7ce91dc5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:55:02,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:55:02,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:55:02,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:55:02,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:55:02,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:55:02,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:55:02,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:55:02,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:55:02,902 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:55:02,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:55:02,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:55:02,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:55:02,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:55:02,903 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:55:02,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:55:02,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:55:02,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:55:02,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:55:02,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:55:02,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:55:02,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:55:02,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:55:02,904 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:55:02,904 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:55:02,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:55:02,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:55:02,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:55:02,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:55:02,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:55:02,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:55:02,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:55:02,905 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:55:02,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:55:02,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:55:02,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:55:02,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:55:02,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:55:02,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:55:02,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:55:02,906 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d15a327968a132f18d81dba73a48626f64398081f4d06a91fc3a4f7ce91dc5c [2025-03-04 02:55:03,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:55:03,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:55:03,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:55:03,161 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:55:03,162 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:55:03,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i [2025-03-04 02:55:04,269 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1e6979d8/704d5cf6e8074b779903068f4791e7e8/FLAG406427945 [2025-03-04 02:55:04,782 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:55:04,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i [2025-03-04 02:55:04,819 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1e6979d8/704d5cf6e8074b779903068f4791e7e8/FLAG406427945 [2025-03-04 02:55:04,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1e6979d8/704d5cf6e8074b779903068f4791e7e8 [2025-03-04 02:55:04,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:55:04,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:55:04,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:55:04,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:55:04,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:55:04,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:55:04" (1/1) ... [2025-03-04 02:55:04,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f57c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:04, skipping insertion in model container [2025-03-04 02:55:04,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:55:04" (1/1) ... [2025-03-04 02:55:04,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:55:05,163 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i[4504,4517] [2025-03-04 02:55:05,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i[4564,4577] [2025-03-04 02:55:06,841 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:06,842 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:06,842 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:06,843 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:06,843 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:06,852 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:06,854 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:06,855 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:06,856 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:06,857 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:06,857 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:06,858 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:06,858 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,631 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,632 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,662 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,663 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,672 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,674 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,698 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,699 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,699 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,700 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,700 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,700 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,700 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,771 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i[227690,227703] [2025-03-04 02:55:08,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:55:08,796 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:55:08,806 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i[4504,4517] [2025-03-04 02:55:08,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i[4564,4577] [2025-03-04 02:55:08,849 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,850 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,851 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,851 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,851 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,859 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,861 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,862 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,863 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,864 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,865 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,866 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,868 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:08,942 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7558-7569] [2025-03-04 02:55:09,018 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:09,019 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:09,026 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:09,027 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:09,031 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:09,031 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:09,042 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:09,044 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:09,044 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:09,044 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:09,044 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:09,046 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:09,046 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:55:09,066 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i[227690,227703] [2025-03-04 02:55:09,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:55:09,311 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:55:09,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09 WrapperNode [2025-03-04 02:55:09,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:55:09,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:55:09,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:55:09,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:55:09,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 02:55:09,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 02:55:09,477 INFO L138 Inliner]: procedures = 763, calls = 2428, calls flagged for inlining = 69, calls inlined = 11, statements flattened = 607 [2025-03-04 02:55:09,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:55:09,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:55:09,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:55:09,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:55:09,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 02:55:09,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 02:55:09,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 02:55:09,556 INFO L175 MemorySlicer]: Split 282 memory accesses to 8 slices as follows [238, 2, 3, 2, 7, 6, 19, 5]. 84 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [6, 2, 0, 0, 0, 0, 0, 5]. The 238 writes are split as follows [232, 0, 1, 1, 1, 2, 1, 0]. [2025-03-04 02:55:09,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 02:55:09,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 02:55:09,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 02:55:09,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 02:55:09,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 02:55:09,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 02:55:09,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:55:09,622 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:55:09,622 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:55:09,622 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:55:09,625 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 02:55:09,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:55:09,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:55:09,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:55:09,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:55:09,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 02:55:09,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 02:55:09,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 02:55:09,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 02:55:09,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 02:55:09,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 02:55:09,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 02:55:09,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-04 02:55:09,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:55:09,679 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_get_entry_count [2025-03-04 02:55:09,679 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_get_entry_count [2025-03-04 02:55:09,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 02:55:09,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 02:55:09,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 02:55:09,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 02:55:09,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 02:55:09,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 02:55:09,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 02:55:09,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 02:55:09,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:55:09,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:55:09,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:55:09,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 02:55:09,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 02:55:09,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 02:55:09,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 02:55:09,682 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:55:09,682 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-03-04 02:55:09,682 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-03-04 02:55:09,682 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:55:09,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 02:55:09,682 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 02:55:09,682 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 02:55:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:55:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-04 02:55:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-03-04 02:55:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 02:55:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-03-04 02:55:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:55:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 02:55:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 02:55:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 02:55:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 02:55:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 02:55:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-03-04 02:55:09,685 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-03-04 02:55:09,947 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:55:09,948 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:55:09,981 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6947: havoc #t~malloc588.base, #t~malloc588.offset; [2025-03-04 02:55:10,005 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10103: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-03-04 02:55:10,050 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-03-04 02:55:10,052 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:55:10,090 INFO L1325 $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-03-04 02:55:10,098 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9146: havoc #t~mem1150; [2025-03-04 02:55:10,173 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-03-04 02:55:10,194 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-03-04 02:55:15,593 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc nondet_size_t_#t~nondet6#1; [2025-03-04 02:55:15,627 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-03-04 02:55:15,628 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:55:15,644 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:55:15,644 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:55:15,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:55:15 BoogieIcfgContainer [2025-03-04 02:55:15,646 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:55:15,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:55:15,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:55:15,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:55:15,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:55:04" (1/3) ... [2025-03-04 02:55:15,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1d50bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:55:15, skipping insertion in model container [2025-03-04 02:55:15,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (2/3) ... [2025-03-04 02:55:15,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1d50bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:55:15, skipping insertion in model container [2025-03-04 02:55:15,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:55:15" (3/3) ... [2025-03-04 02:55:15,656 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_get_entry_count_harness.i [2025-03-04 02:55:15,668 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:55:15,669 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_get_entry_count_harness.i that has 15 procedures, 121 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 02:55:15,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:55:15,725 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;@14d1988e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:55:15,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:55:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 80 states have internal predecessors, (93), 26 states have call successors, (26), 14 states have call predecessors, (26), 14 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 02:55:15,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 02:55:15,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:55:15,737 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:55:15,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:55:15,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:55:15,743 INFO L85 PathProgramCache]: Analyzing trace with hash 851101490, now seen corresponding path program 1 times [2025-03-04 02:55:15,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:55:15,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532795884] [2025-03-04 02:55:15,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:15,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:55:20,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 02:55:20,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 02:55:20,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:20,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:21,076 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-04 02:55:21,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:55:21,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532795884] [2025-03-04 02:55:21,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532795884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:55:21,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102500323] [2025-03-04 02:55:21,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:21,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:55:21,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:55:21,079 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:55:21,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:55:25,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 02:55:25,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 02:55:25,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:25,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:25,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 4316 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:55:25,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:55:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-04 02:55:25,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:55:25,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102500323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:55:25,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:55:25,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:55:25,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120633108] [2025-03-04 02:55:25,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:55:25,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:55:25,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:55:25,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:55:25,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:55:25,549 INFO L87 Difference]: Start difference. First operand has 121 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 80 states have internal predecessors, (93), 26 states have call successors, (26), 14 states have call predecessors, (26), 14 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 02:55:25,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:55:25,589 INFO L93 Difference]: Finished difference Result 234 states and 297 transitions. [2025-03-04 02:55:25,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:55:25,591 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2025-03-04 02:55:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:55:25,595 INFO L225 Difference]: With dead ends: 234 [2025-03-04 02:55:25,596 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 02:55:25,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:55:25,600 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:55:25,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:55:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 02:55:25,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-04 02:55:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 74 states have (on average 1.1486486486486487) internal successors, (85), 75 states have internal predecessors, (85), 26 states have call successors, (26), 14 states have call predecessors, (26), 14 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 02:55:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2025-03-04 02:55:25,630 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 108 [2025-03-04 02:55:25,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:55:25,630 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2025-03-04 02:55:25,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 02:55:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2025-03-04 02:55:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 02:55:25,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:55:25,635 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:55:25,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:55:25,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 02:55:25,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:55:25,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:55:25,836 INFO L85 PathProgramCache]: Analyzing trace with hash -776573964, now seen corresponding path program 1 times [2025-03-04 02:55:25,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:55:25,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153484925] [2025-03-04 02:55:25,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:25,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:55:29,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 02:55:29,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 02:55:29,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:29,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 02:55:30,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:55:30,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153484925] [2025-03-04 02:55:30,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153484925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:55:30,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852793239] [2025-03-04 02:55:30,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:30,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:55:30,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:55:30,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:55:30,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:55:35,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 02:55:35,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 02:55:35,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:35,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:35,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 4316 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:55:35,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:55:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 02:55:35,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:55:35,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852793239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:55:35,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:55:35,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2025-03-04 02:55:35,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869576684] [2025-03-04 02:55:35,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:55:35,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:55:35,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:55:35,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:55:35,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:55:35,791 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 02:55:36,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:55:36,002 INFO L93 Difference]: Finished difference Result 223 states and 264 transitions. [2025-03-04 02:55:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:55:36,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2025-03-04 02:55:36,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:55:36,004 INFO L225 Difference]: With dead ends: 223 [2025-03-04 02:55:36,005 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 02:55:36,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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-03-04 02:55:36,007 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:55:36,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 524 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:55:36,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 02:55:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-04 02:55:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.141025641025641) internal successors, (89), 79 states have internal predecessors, (89), 26 states have call successors, (26), 14 states have call predecessors, (26), 15 states have return successors, (26), 26 states have call predecessors, (26), 25 states have call successors, (26) [2025-03-04 02:55:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2025-03-04 02:55:36,024 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 108 [2025-03-04 02:55:36,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:55:36,025 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2025-03-04 02:55:36,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 02:55:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2025-03-04 02:55:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 02:55:36,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:55:36,027 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:55:36,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:55:36,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 02:55:36,228 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:55:36,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:55:36,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1530339116, now seen corresponding path program 1 times [2025-03-04 02:55:36,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:55:36,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603516982] [2025-03-04 02:55:36,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:36,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:55:39,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 02:55:39,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 02:55:39,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:39,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-04 02:55:43,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:55:43,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603516982] [2025-03-04 02:55:43,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603516982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:55:43,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:55:43,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:55:43,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533571262] [2025-03-04 02:55:43,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:55:43,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:55:43,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:55:43,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:55:43,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:55:43,252 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 02:55:44,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:55:44,878 INFO L93 Difference]: Finished difference Result 224 states and 262 transitions. [2025-03-04 02:55:44,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:55:44,879 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 120 [2025-03-04 02:55:44,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:55:44,881 INFO L225 Difference]: With dead ends: 224 [2025-03-04 02:55:44,881 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 02:55:44,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:55:44,882 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 20 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:55:44,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 786 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 02:55:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 02:55:44,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2025-03-04 02:55:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 80 states have (on average 1.1375) internal successors, (91), 81 states have internal predecessors, (91), 26 states have call successors, (26), 14 states have call predecessors, (26), 15 states have return successors, (26), 26 states have call predecessors, (26), 25 states have call successors, (26) [2025-03-04 02:55:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2025-03-04 02:55:44,895 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 120 [2025-03-04 02:55:44,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:55:44,895 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2025-03-04 02:55:44,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 02:55:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2025-03-04 02:55:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 02:55:44,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:55:44,897 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:55:44,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:55:44,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:55:44,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:55:44,897 INFO L85 PathProgramCache]: Analyzing trace with hash 839094869, now seen corresponding path program 1 times [2025-03-04 02:55:44,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:55:44,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884579200] [2025-03-04 02:55:44,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:44,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:55:48,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 02:55:48,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 02:55:48,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:48,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-04 02:55:49,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:55:49,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884579200] [2025-03-04 02:55:49,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884579200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:55:49,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:55:49,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:55:49,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602439945] [2025-03-04 02:55:49,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:55:49,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:55:49,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:55:49,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:55:49,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:55:49,318 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 02:55:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:55:49,496 INFO L93 Difference]: Finished difference Result 225 states and 262 transitions. [2025-03-04 02:55:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:55:49,497 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), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 120 [2025-03-04 02:55:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:55:49,499 INFO L225 Difference]: With dead ends: 225 [2025-03-04 02:55:49,500 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 02:55:49,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:55:49,501 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 15 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:55:49,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 366 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:55:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 02:55:49,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-04 02:55:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.1153846153846154) internal successors, (87), 79 states have internal predecessors, (87), 26 states have call successors, (26), 14 states have call predecessors, (26), 15 states have return successors, (26), 26 states have call predecessors, (26), 25 states have call successors, (26) [2025-03-04 02:55:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2025-03-04 02:55:49,509 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 120 [2025-03-04 02:55:49,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:55:49,509 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2025-03-04 02:55:49,509 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), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 02:55:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2025-03-04 02:55:49,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 02:55:49,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:55:49,511 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:55:49,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:55:49,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:55:49,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:55:49,511 INFO L85 PathProgramCache]: Analyzing trace with hash 110275188, now seen corresponding path program 1 times [2025-03-04 02:55:49,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:55:49,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854072182] [2025-03-04 02:55:49,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:49,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:55:53,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 02:55:53,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 02:55:53,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:53,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-04 02:55:55,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:55:55,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854072182] [2025-03-04 02:55:55,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854072182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:55:55,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:55:55,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:55:55,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354628258] [2025-03-04 02:55:55,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:55:55,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:55:55,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:55:55,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:55:55,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:55:55,096 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 02:55:55,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:55:55,576 INFO L93 Difference]: Finished difference Result 218 states and 251 transitions. [2025-03-04 02:55:55,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:55:55,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 126 [2025-03-04 02:55:55,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:55:55,577 INFO L225 Difference]: With dead ends: 218 [2025-03-04 02:55:55,577 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 02:55:55,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:55:55,579 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 2 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 02:55:55,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 744 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 02:55:55,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 02:55:55,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-04 02:55:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 79 states have internal predecessors, (86), 26 states have call successors, (26), 14 states have call predecessors, (26), 15 states have return successors, (26), 26 states have call predecessors, (26), 25 states have call successors, (26) [2025-03-04 02:55:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2025-03-04 02:55:55,590 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 126 [2025-03-04 02:55:55,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:55:55,590 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2025-03-04 02:55:55,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 02:55:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2025-03-04 02:55:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 02:55:55,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:55:55,592 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:55:55,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:55:55,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:55:55,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:55:55,592 INFO L85 PathProgramCache]: Analyzing trace with hash -936808756, now seen corresponding path program 1 times [2025-03-04 02:55:55,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:55:55,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697702434] [2025-03-04 02:55:55,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:55,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:55:59,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 02:55:59,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 02:55:59,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:59,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:56:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 02:56:02,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:56:02,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697702434] [2025-03-04 02:56:02,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697702434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:56:02,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63853653] [2025-03-04 02:56:02,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:02,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:56:02,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:56:02,167 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:56:02,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:56:06,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 02:56:07,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 02:56:07,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:56:07,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:56:07,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 4380 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-04 02:56:07,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:56:08,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:56:08,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 1 [2025-03-04 02:56:08,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:56:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 55 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 02:56:15,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:56:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 02:56:26,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63853653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:56:26,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:56:26,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 21, 15] total 37 [2025-03-04 02:56:26,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877341782] [2025-03-04 02:56:26,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:56:26,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 02:56:26,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:56:26,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 02:56:26,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1229, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 02:56:26,383 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand has 37 states, 31 states have (on average 4.096774193548387) internal successors, (127), 27 states have internal predecessors, (127), 10 states have call successors, (44), 4 states have call predecessors, (44), 12 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44)