./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_swap_harness_negated.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_swap_harness_negated.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 4327c1d0a3798141341f75fbfeacee6e434c9dfc309a1d3ed778376faac4823c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:56:24,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:56:24,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:56:24,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:56:24,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:56:24,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:56:24,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:56:24,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:56:24,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:56:24,850 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:56:24,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:56:24,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:56:24,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:56:24,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:56:24,851 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:56:24,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:56:24,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:56:24,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:56:24,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:56:24,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:56:24,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:56:24,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:56:24,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:56:24,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:56:24,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:56:24,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:56:24,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:56:24,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:56:24,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:56:24,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:56:24,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:56:24,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:56:24,853 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:56:24,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:56:24,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:56:24,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:56:24,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:56:24,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:56:24,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:56:24,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:56:24,854 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 -> 4327c1d0a3798141341f75fbfeacee6e434c9dfc309a1d3ed778376faac4823c [2025-03-04 02:56:25,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:56:25,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:56:25,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:56:25,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:56:25,120 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:56:25,121 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_swap_harness_negated.i [2025-03-04 02:56:26,291 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc765d5e6/dfc6a2f7b8384aac9e8651b875e09aef/FLAG96bc86151 [2025-03-04 02:56:26,745 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:56:26,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_swap_harness_negated.i [2025-03-04 02:56:26,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc765d5e6/dfc6a2f7b8384aac9e8651b875e09aef/FLAG96bc86151 [2025-03-04 02:56:26,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc765d5e6/dfc6a2f7b8384aac9e8651b875e09aef [2025-03-04 02:56:26,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:56:26,840 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:56:26,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:56:26,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:56:26,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:56:26,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:56:26" (1/1) ... [2025-03-04 02:56:26,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f03c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:26, skipping insertion in model container [2025-03-04 02:56:26,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:56:26" (1/1) ... [2025-03-04 02:56:26,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:56:27,162 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_swap_harness_negated.i[4493,4506] [2025-03-04 02:56:27,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_swap_harness_negated.i[4553,4566] [2025-03-04 02:56:27,875 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:27,876 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:27,876 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:27,877 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:27,877 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:27,888 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:27,889 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:27,890 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:27,891 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:27,892 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:27,893 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:27,894 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:27,894 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,568 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,568 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,596 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,597 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,604 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,605 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,621 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,622 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,622 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,622 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,622 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,623 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,623 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,686 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_swap_harness_negated.i[228391,228404] [2025-03-04 02:56:28,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:56:28,714 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:56:28,727 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_swap_harness_negated.i[4493,4506] [2025-03-04 02:56:28,728 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_swap_harness_negated.i[4553,4566] [2025-03-04 02:56:28,757 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,757 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,758 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,758 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,758 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,767 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,767 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,767 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7526-7537] [2025-03-04 02:56:28,884 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,884 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,890 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,890 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,892 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,892 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,899 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,900 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,900 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,900 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,900 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,901 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,902 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:56:28,915 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_swap_harness_negated.i[228391,228404] [2025-03-04 02:56:28,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:56:29,078 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:56:29,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:29 WrapperNode [2025-03-04 02:56:29,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:56:29,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:56:29,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:56:29,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:56:29,085 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:56:29" (1/1) ... [2025-03-04 02:56:29,148 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:56:29" (1/1) ... [2025-03-04 02:56:29,184 INFO L138 Inliner]: procedures = 763, calls = 2436, calls flagged for inlining = 67, calls inlined = 9, statements flattened = 598 [2025-03-04 02:56:29,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:56:29,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:56:29,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:56:29,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:56:29,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:29" (1/1) ... [2025-03-04 02:56:29,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:29" (1/1) ... [2025-03-04 02:56:29,199 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:29" (1/1) ... [2025-03-04 02:56:29,250 INFO L175 MemorySlicer]: Split 284 memory accesses to 9 slices as follows [2, 238, 6, 9, 2, 17, 2, 3, 5]. 84 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 6, 0, 0, 0, 0, 1, 0, 5]. The 240 writes are split as follows [0, 232, 2, 3, 1, 1, 0, 1, 0]. [2025-03-04 02:56:29,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:29" (1/1) ... [2025-03-04 02:56:29,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:29" (1/1) ... [2025-03-04 02:56:29,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:29" (1/1) ... [2025-03-04 02:56:29,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:29" (1/1) ... [2025-03-04 02:56:29,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:29" (1/1) ... [2025-03-04 02:56:29,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:29" (1/1) ... [2025-03-04 02:56:29,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:56:29,303 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:56:29,303 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:56:29,303 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:56:29,304 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:29" (1/1) ... [2025-03-04 02:56:29,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:56:29,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:56:29,333 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:56:29,336 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:56:29,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 02:56:29,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 02:56:29,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 02:56:29,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 02:56:29,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 02:56:29,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 02:56:29,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 02:56:29,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-04 02:56:29,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-04 02:56:29,354 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_hash_table [2025-03-04 02:56:29,354 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_hash_table [2025-03-04 02:56:29,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:56:29,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 02:56:29,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 02:56:29,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 02:56:29,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 02:56:29,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 02:56:29,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 02:56:29,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 02:56:29,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 02:56:29,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 02:56:29,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:56:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:56:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:56:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 02:56:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 02:56:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 02:56:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 02:56:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 02:56:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 02:56:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 02:56:29,356 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 02:56:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:56:29,356 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:56:29,357 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-03-04 02:56:29,357 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-03-04 02:56:29,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:56:29,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:56:29,357 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-03-04 02:56:29,357 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-03-04 02:56:29,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:56:29,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:56:29,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:56:29,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 02:56:29,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 02:56:29,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 02:56:29,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 02:56:29,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 02:56:29,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 02:56:29,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:56:29,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:56:29,358 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 02:56:29,358 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 02:56:29,358 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 02:56:29,359 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 02:56:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 02:56:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 02:56:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 02:56:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 02:56:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 02:56:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 02:56:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 02:56:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 02:56:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 02:56:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:56:29,359 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:56:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:56:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-04 02:56:29,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-04 02:56:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:56:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:56:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:56:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 02:56:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 02:56:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 02:56:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 02:56:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 02:56:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-03-04 02:56:29,361 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_allocated_hash_table [2025-03-04 02:56:29,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_allocated_hash_table [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 02:56:29,361 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-03-04 02:56:29,361 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:56:29,361 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure check_hash_table_unchanged [2025-03-04 02:56:29,361 INFO L138 BoogieDeclarations]: Found implementation of procedure check_hash_table_unchanged [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 02:56:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-03-04 02:56:29,361 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-03-04 02:56:29,662 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:56:29,664 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:56:29,692 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6935: havoc #t~malloc588.base, #t~malloc588.offset; [2025-03-04 02:56:29,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-03-04 02:56:29,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:56:29,771 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc nondet_size_t_#t~nondet6#1; [2025-03-04 02:56:29,832 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10069: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-03-04 02:56:29,849 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9956: havoc #t~mem1489.base, #t~mem1489.offset;havoc #t~short1490;havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~ret1492;havoc #t~short1493; [2025-03-04 02:56:29,887 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-03-04 02:56:29,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-03-04 02:56:34,991 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-03-04 02:56:34,991 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:56:35,003 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:56:35,004 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:56:35,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:56:35 BoogieIcfgContainer [2025-03-04 02:56:35,005 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:56:35,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:56:35,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:56:35,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:56:35,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:56:26" (1/3) ... [2025-03-04 02:56:35,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fc4e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:56:35, skipping insertion in model container [2025-03-04 02:56:35,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:56:29" (2/3) ... [2025-03-04 02:56:35,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fc4e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:56:35, skipping insertion in model container [2025-03-04 02:56:35,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:56:35" (3/3) ... [2025-03-04 02:56:35,012 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_swap_harness_negated.i [2025-03-04 02:56:35,024 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:56:35,026 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_swap_harness_negated.i that has 17 procedures, 142 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 02:56:35,070 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:56:35,079 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;@4d306690, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:56:35,080 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:56:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 89 states have (on average 1.202247191011236) internal successors, (107), 94 states have internal predecessors, (107), 35 states have call successors, (35), 16 states have call predecessors, (35), 16 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 02:56:35,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 02:56:35,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:56:35,090 INFO L218 NwaCegarLoop]: trace histogram [1, 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:56:35,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:56:35,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:56:35,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1081493422, now seen corresponding path program 1 times [2025-03-04 02:56:35,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:56:35,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746816196] [2025-03-04 02:56:35,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:35,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:56:39,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:56:39,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:56:39,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:56:39,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:56:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:56:39,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:56:39,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746816196] [2025-03-04 02:56:39,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746816196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:56:39,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:56:39,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:56:39,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599394830] [2025-03-04 02:56:39,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:56:39,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:56:39,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:56:39,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:56:39,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:56:39,940 INFO L87 Difference]: Start difference. First operand has 142 states, 89 states have (on average 1.202247191011236) internal successors, (107), 94 states have internal predecessors, (107), 35 states have call successors, (35), 16 states have call predecessors, (35), 16 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 02:56:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:56:39,986 INFO L93 Difference]: Finished difference Result 280 states and 374 transitions. [2025-03-04 02:56:39,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:56:39,989 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-03-04 02:56:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:56:39,994 INFO L225 Difference]: With dead ends: 280 [2025-03-04 02:56:39,995 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 02:56:40,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:56:40,004 INFO L435 NwaCegarLoop]: 173 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, 173 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:56:40,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:56:40,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 02:56:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-04 02:56:40,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 85 states have (on average 1.1647058823529413) internal successors, (99), 89 states have internal predecessors, (99), 35 states have call successors, (35), 16 states have call predecessors, (35), 16 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 02:56:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 168 transitions. [2025-03-04 02:56:40,046 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 168 transitions. Word has length 25 [2025-03-04 02:56:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:56:40,047 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 168 transitions. [2025-03-04 02:56:40,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 02:56:40,047 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 168 transitions. [2025-03-04 02:56:40,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 02:56:40,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:56:40,049 INFO L218 NwaCegarLoop]: trace histogram [1, 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:56:40,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:56:40,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:56:40,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:56:40,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2078565775, now seen corresponding path program 1 times [2025-03-04 02:56:40,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:56:40,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149463041] [2025-03-04 02:56:40,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:40,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:56:44,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:56:44,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:56:44,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:56:44,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:56:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:56:44,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:56:44,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149463041] [2025-03-04 02:56:44,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149463041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:56:44,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:56:44,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:56:44,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475099241] [2025-03-04 02:56:44,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:56:44,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:56:44,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:56:44,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:56:44,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:56:44,573 INFO L87 Difference]: Start difference. First operand 137 states and 168 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 02:56:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:56:44,671 INFO L93 Difference]: Finished difference Result 192 states and 238 transitions. [2025-03-04 02:56:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:56:44,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-03-04 02:56:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:56:44,674 INFO L225 Difference]: With dead ends: 192 [2025-03-04 02:56:44,675 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 02:56:44,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:56:44,676 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 2 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 328 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-03-04 02:56:44,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 328 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:56:44,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 02:56:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-04 02:56:44,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 91 states have (on average 1.164835164835165) internal successors, (106), 95 states have internal predecessors, (106), 40 states have call successors, (40), 16 states have call predecessors, (40), 16 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-04 02:56:44,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 185 transitions. [2025-03-04 02:56:44,694 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 185 transitions. Word has length 25 [2025-03-04 02:56:44,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:56:44,698 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 185 transitions. [2025-03-04 02:56:44,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 02:56:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 185 transitions. [2025-03-04 02:56:44,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 02:56:44,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:56:44,699 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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:56:44,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:56:44,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:56:44,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:56:44,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1629139524, now seen corresponding path program 1 times [2025-03-04 02:56:44,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:56:44,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175256379] [2025-03-04 02:56:44,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:56:48,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:56:48,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:56:48,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:56:48,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:56:49,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:56:49,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:56:49,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175256379] [2025-03-04 02:56:49,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175256379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:56:49,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:56:49,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:56:49,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239663559] [2025-03-04 02:56:49,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:56:49,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:56:49,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:56:49,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:56:49,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:56:49,043 INFO L87 Difference]: Start difference. First operand 148 states and 185 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 02:56:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:56:49,120 INFO L93 Difference]: Finished difference Result 202 states and 250 transitions. [2025-03-04 02:56:49,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:56:49,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-04 02:56:49,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:56:49,124 INFO L225 Difference]: With dead ends: 202 [2025-03-04 02:56:49,124 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 02:56:49,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:56:49,125 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:56:49,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 330 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:56:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 02:56:49,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-04 02:56:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.1458333333333333) internal successors, (110), 99 states have internal predecessors, (110), 44 states have call successors, (44), 16 states have call predecessors, (44), 16 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 02:56:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 196 transitions. [2025-03-04 02:56:49,147 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 196 transitions. Word has length 26 [2025-03-04 02:56:49,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:56:49,147 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 196 transitions. [2025-03-04 02:56:49,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 02:56:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 196 transitions. [2025-03-04 02:56:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 02:56:49,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:56:49,153 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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:56:49,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:56:49,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:56:49,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:56:49,153 INFO L85 PathProgramCache]: Analyzing trace with hash -934386176, now seen corresponding path program 1 times [2025-03-04 02:56:49,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:56:49,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636362764] [2025-03-04 02:56:49,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:49,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:56:52,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 02:56:53,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 02:56:53,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:56:53,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:56:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-04 02:56:54,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:56:54,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636362764] [2025-03-04 02:56:54,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636362764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:56:54,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368931617] [2025-03-04 02:56:54,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:54,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:56:54,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:56:54,226 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:56:54,228 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:56:58,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 02:56:59,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 02:56:59,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:56:59,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:56:59,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 4483 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:56:59,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:56:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 02:56:59,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:56:59,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368931617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:56:59,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:56:59,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2025-03-04 02:56:59,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625769928] [2025-03-04 02:56:59,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:56:59,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:56:59,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:56:59,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:56:59,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:56:59,289 INFO L87 Difference]: Start difference. First operand 157 states and 196 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 02:56:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:56:59,502 INFO L93 Difference]: Finished difference Result 313 states and 397 transitions. [2025-03-04 02:56:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:56:59,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 128 [2025-03-04 02:56:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:56:59,504 INFO L225 Difference]: With dead ends: 313 [2025-03-04 02:56:59,504 INFO L226 Difference]: Without dead ends: 162 [2025-03-04 02:56:59,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 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:56:59,505 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 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:56:59,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:56:59,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-04 02:56:59,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-04 02:56:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 100 states have (on average 1.14) internal successors, (114), 103 states have internal predecessors, (114), 44 states have call successors, (44), 16 states have call predecessors, (44), 17 states have return successors, (43), 43 states have call predecessors, (43), 42 states have call successors, (43) [2025-03-04 02:56:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 201 transitions. [2025-03-04 02:56:59,523 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 201 transitions. Word has length 128 [2025-03-04 02:56:59,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:56:59,526 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 201 transitions. [2025-03-04 02:56:59,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 02:56:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 201 transitions. [2025-03-04 02:56:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 02:56:59,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:56:59,528 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 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:56:59,550 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:56:59,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:56:59,729 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:56:59,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:56:59,730 INFO L85 PathProgramCache]: Analyzing trace with hash 246150362, now seen corresponding path program 1 times [2025-03-04 02:56:59,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:56:59,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346357206] [2025-03-04 02:56:59,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:56:59,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:03,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 02:57:03,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 02:57:03,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:03,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-04 02:57:07,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:07,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346357206] [2025-03-04 02:57:07,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346357206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:07,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937621038] [2025-03-04 02:57:07,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:07,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:07,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:07,250 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:57:07,251 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:57:11,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 02:57:11,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 02:57:11,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:11,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:11,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 4491 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 02:57:11,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:12,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:57:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 02:57:14,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:14,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937621038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:14,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:14,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 16 [2025-03-04 02:57:14,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88443016] [2025-03-04 02:57:14,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:14,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:57:14,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:14,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:57:14,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:57:14,104 INFO L87 Difference]: Start difference. First operand 162 states and 201 transitions. Second operand has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 5 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 02:57:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:21,022 INFO L93 Difference]: Finished difference Result 390 states and 481 transitions. [2025-03-04 02:57:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:57:21,022 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 5 states have call predecessors, (22), 4 states have call successors, (22) Word has length 140 [2025-03-04 02:57:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:21,025 INFO L225 Difference]: With dead ends: 390 [2025-03-04 02:57:21,025 INFO L226 Difference]: Without dead ends: 244 [2025-03-04 02:57:21,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:57:21,026 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 150 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:21,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1649 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-03-04 02:57:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-04 02:57:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 240. [2025-03-04 02:57:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 152 states have (on average 1.138157894736842) internal successors, (173), 156 states have internal predecessors, (173), 58 states have call successors, (58), 27 states have call predecessors, (58), 29 states have return successors, (63), 57 states have call predecessors, (63), 56 states have call successors, (63) [2025-03-04 02:57:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 294 transitions. [2025-03-04 02:57:21,047 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 294 transitions. Word has length 140 [2025-03-04 02:57:21,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:21,047 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 294 transitions. [2025-03-04 02:57:21,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 5 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 02:57:21,047 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 294 transitions. [2025-03-04 02:57:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 02:57:21,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:21,051 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 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, 1, 1] [2025-03-04 02:57:21,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:57:21,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:21,252 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:21,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash -162725, now seen corresponding path program 1 times [2025-03-04 02:57:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:21,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359953708] [2025-03-04 02:57:21,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:21,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:24,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 02:57:24,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 02:57:24,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:24,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-04 02:57:25,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:25,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359953708] [2025-03-04 02:57:25,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359953708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:25,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054284161] [2025-03-04 02:57:25,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:25,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:25,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:25,862 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:57:25,864 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:57:30,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 02:57:30,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 02:57:30,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:30,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:30,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 4486 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:57:30,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 02:57:31,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:31,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054284161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:31,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:31,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-03-04 02:57:31,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90107225] [2025-03-04 02:57:31,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:31,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:57:31,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:31,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:57:31,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:57:31,173 INFO L87 Difference]: Start difference. First operand 240 states and 294 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 02:57:32,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:32,248 INFO L93 Difference]: Finished difference Result 396 states and 491 transitions. [2025-03-04 02:57:32,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:57:32,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 140 [2025-03-04 02:57:32,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:32,252 INFO L225 Difference]: With dead ends: 396 [2025-03-04 02:57:32,252 INFO L226 Difference]: Without dead ends: 245 [2025-03-04 02:57:32,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:57:32,253 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 167 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:32,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 568 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 02:57:32,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-04 02:57:32,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-03-04 02:57:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 155 states have (on average 1.135483870967742) internal successors, (176), 160 states have internal predecessors, (176), 59 states have call successors, (59), 27 states have call predecessors, (59), 30 states have return successors, (68), 58 states have call predecessors, (68), 57 states have call successors, (68) [2025-03-04 02:57:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 303 transitions. [2025-03-04 02:57:32,266 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 303 transitions. Word has length 140 [2025-03-04 02:57:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:32,267 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 303 transitions. [2025-03-04 02:57:32,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 02:57:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 303 transitions. [2025-03-04 02:57:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 02:57:32,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:32,268 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 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, 1] [2025-03-04 02:57:32,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:57:32,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:32,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:32,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:32,469 INFO L85 PathProgramCache]: Analyzing trace with hash -92949376, now seen corresponding path program 1 times [2025-03-04 02:57:32,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:32,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075450494] [2025-03-04 02:57:32,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:32,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:36,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 02:57:36,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 02:57:36,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:36,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-04 02:57:39,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:39,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075450494] [2025-03-04 02:57:39,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075450494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:39,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914039047] [2025-03-04 02:57:39,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:39,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:39,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:39,186 INFO L229 MonitoredProcess]: Starting monitored process 5 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:57:39,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:57:43,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 02:57:44,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 02:57:44,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:44,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:44,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 4493 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 02:57:44,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:44,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-04 02:57:44,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:57:48,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2025-03-04 02:57:48,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2025-03-04 02:57:48,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-04 02:57:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 02:57:49,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:49,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914039047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:49,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:49,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 20 [2025-03-04 02:57:49,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286616046] [2025-03-04 02:57:49,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:49,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:57:49,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:49,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:57:49,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:57:49,768 INFO L87 Difference]: Start difference. First operand 245 states and 303 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 8 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22)