./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_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_clean_up_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 50d4d1f2ae5bba89cc186bb0972ef2b0cd77f1837349703818d4cbd39178a465 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:54:04,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:54:04,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:54:04,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:54:04,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:54:04,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:54:04,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:54:04,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:54:04,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:54:04,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:54:04,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:54:04,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:54:04,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:54:04,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:54:04,588 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:54:04,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:54:04,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:54:04,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:54:04,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:54:04,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:54:04,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:54:04,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:54:04,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:54:04,589 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:54:04,589 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:54:04,589 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:54:04,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:54:04,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:54:04,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:54:04,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:54:04,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:54:04,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:54:04,590 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:54:04,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:54:04,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:54:04,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:54:04,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:54:04,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:54:04,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:54:04,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:54:04,591 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 -> 50d4d1f2ae5bba89cc186bb0972ef2b0cd77f1837349703818d4cbd39178a465 [2025-03-04 02:54:04,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:54:04,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:54:04,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:54:04,825 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:54:04,826 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:54:04,826 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_clean_up_harness_negated.i [2025-03-04 02:54:05,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c1d9c850/b564c3269af9460db23308854d9c543e/FLAG12d54893a [2025-03-04 02:54:06,439 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:54:06,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness_negated.i [2025-03-04 02:54:06,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c1d9c850/b564c3269af9460db23308854d9c543e/FLAG12d54893a [2025-03-04 02:54:06,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c1d9c850/b564c3269af9460db23308854d9c543e [2025-03-04 02:54:06,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:54:06,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:54:06,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:54:06,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:54:06,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:54:06,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:54:06" (1/1) ... [2025-03-04 02:54:06,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@493ac9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:06, skipping insertion in model container [2025-03-04 02:54:06,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:54:06" (1/1) ... [2025-03-04 02:54:06,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:54:06,854 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_clean_up_harness_negated.i[4497,4510] [2025-03-04 02:54:06,862 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_clean_up_harness_negated.i[4557,4570] [2025-03-04 02:54:08,190 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,191 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,192 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,192 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,193 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,202 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,203 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,204 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,204 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,205 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,206 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,206 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,206 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,164 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,166 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,186 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,186 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,190 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,190 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,203 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,204 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,204 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,205 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,205 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,205 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,205 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,232 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_clean_up_harness_negated.i[228637,228650] [2025-03-04 02:54:09,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:54:09,258 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:54:09,270 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_clean_up_harness_negated.i[4497,4510] [2025-03-04 02:54:09,270 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_clean_up_harness_negated.i[4557,4570] [2025-03-04 02:54:09,310 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,311 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,312 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,312 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,313 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,318 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,321 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,321 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,322 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,322 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,323 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,323 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,323 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,390 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7553-7564] [2025-03-04 02:54:09,500 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,500 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,506 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,506 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,508 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,509 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,516 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,516 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,516 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,517 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,517 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,517 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,517 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:09,533 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_clean_up_harness_negated.i[228637,228650] [2025-03-04 02:54:09,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:54:09,697 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:54:09,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:09 WrapperNode [2025-03-04 02:54:09,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:54:09,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:54:09,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:54:09,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:54:09,703 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:54:09" (1/1) ... [2025-03-04 02:54:09,765 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:54:09" (1/1) ... [2025-03-04 02:54:09,814 INFO L138 Inliner]: procedures = 764, calls = 2440, calls flagged for inlining = 72, calls inlined = 16, statements flattened = 716 [2025-03-04 02:54:09,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:54:09,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:54:09,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:54:09,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:54:09,824 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:09" (1/1) ... [2025-03-04 02:54:09,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:09" (1/1) ... [2025-03-04 02:54:09,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:09" (1/1) ... [2025-03-04 02:54:09,901 INFO L175 MemorySlicer]: Split 304 memory accesses to 8 slices as follows [238, 1, 2, 16, 2, 37, 2, 6]. 78 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [6, 0, 2, 0, 0, 0, 0, 5]. The 243 writes are split as follows [232, 1, 0, 2, 1, 6, 1, 0]. [2025-03-04 02:54:09,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:09" (1/1) ... [2025-03-04 02:54:09,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:09" (1/1) ... [2025-03-04 02:54:09,928 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:09" (1/1) ... [2025-03-04 02:54:09,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:09" (1/1) ... [2025-03-04 02:54:09,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:09" (1/1) ... [2025-03-04 02:54:09,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:09" (1/1) ... [2025-03-04 02:54:09,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:54:09,961 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:54:09,961 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:54:09,962 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:54:09,962 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:09" (1/1) ... [2025-03-04 02:54:09,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:54:09,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:54:09,991 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:54:09,995 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:54:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure memset_override_0_impl [2025-03-04 02:54:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_override_0_impl [2025-03-04 02:54:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 02:54:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 02:54:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 02:54:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 02:54:10,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 02:54:10,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-04 02:54:10,016 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 02:54:10,016 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:54:10,016 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-03-04 02:54:10,016 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-03-04 02:54:10,016 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 02:54:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 02:54:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:54:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 02:54:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 02:54:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-03-04 02:54:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:54:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-04 02:54:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 02:54:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-03-04 02:54:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-03-04 02:54:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:54:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:54:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:54:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 02:54:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 02:54:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 02:54:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 02:54:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 02:54:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-04 02:54:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-04 02:54:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 02:54:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 02:54:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-03-04 02:54:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-03-04 02:54:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:54:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:54:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:54:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:54:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:54:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 02:54:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 02:54:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 02:54:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 02:54:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 02:54:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2025-03-04 02:54:10,023 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2025-03-04 02:54:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:54:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:54:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:54:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 02:54:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 02:54:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 02:54:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 02:54:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 02:54:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-03-04 02:54:10,023 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-03-04 02:54:10,343 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:54:10,345 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:54:10,369 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6935: havoc #t~malloc588.base, #t~malloc588.offset; [2025-03-04 02:54:10,386 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10096: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-03-04 02:54:10,443 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-03-04 02:54:10,446 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:54:10,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7383: havoc #t~ret691.base, #t~ret691.offset; [2025-03-04 02:54:10,479 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9983: havoc #t~mem1492.base, #t~mem1492.offset;havoc #t~short1493;havoc #t~mem1494.base, #t~mem1494.offset;havoc #t~ret1495;havoc #t~short1496; [2025-03-04 02:54:10,484 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-04 02:54:10,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-03-04 02:54:10,595 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-03-04 02:54:15,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6821: havoc aws_hash_table_has_an_empty_slot_#t~mem566#1.base, aws_hash_table_has_an_empty_slot_#t~mem566#1.offset;havoc aws_hash_table_has_an_empty_slot_#t~ret567#1; [2025-03-04 02:54:15,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6831: havoc hash_table_state_has_an_empty_slot_#t~mem571#1; [2025-03-04 02:54:15,805 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2025-03-04 02:54:15,806 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:54:15,824 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:54:15,825 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:54:15,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:54:15 BoogieIcfgContainer [2025-03-04 02:54:15,826 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:54:15,828 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:54:15,828 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:54:15,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:54:15,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:54:06" (1/3) ... [2025-03-04 02:54:15,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc85b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:54:15, skipping insertion in model container [2025-03-04 02:54:15,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:09" (2/3) ... [2025-03-04 02:54:15,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc85b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:54:15, skipping insertion in model container [2025-03-04 02:54:15,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:54:15" (3/3) ... [2025-03-04 02:54:15,833 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_clean_up_harness_negated.i [2025-03-04 02:54:15,844 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:54:15,845 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_clean_up_harness_negated.i that has 20 procedures, 198 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:54:15,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:54:15,905 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;@16576a27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:54:15,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:54:15,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 130 states have (on average 1.1923076923076923) internal successors, (155), 131 states have internal predecessors, (155), 47 states have call successors, (47), 19 states have call predecessors, (47), 19 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 02:54:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 02:54:15,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:15,922 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:54:15,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:15,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:15,927 INFO L85 PathProgramCache]: Analyzing trace with hash 440707454, now seen corresponding path program 1 times [2025-03-04 02:54:15,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:15,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713120958] [2025-03-04 02:54:15,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:15,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:20,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 02:54:20,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 02:54:20,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:20,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 02:54:21,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:21,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713120958] [2025-03-04 02:54:21,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713120958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:54:21,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131808538] [2025-03-04 02:54:21,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:21,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:54:21,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:54:21,153 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:54:21,154 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:54:25,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 02:54:26,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 02:54:26,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:26,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:26,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 4328 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:54:26,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:54:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-03-04 02:54:26,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:54:26,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131808538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:26,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:54:26,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:54:26,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347199191] [2025-03-04 02:54:26,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:26,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:54:26,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:26,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:54:26,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:54:26,288 INFO L87 Difference]: Start difference. First operand has 198 states, 130 states have (on average 1.1923076923076923) internal successors, (155), 131 states have internal predecessors, (155), 47 states have call successors, (47), 19 states have call predecessors, (47), 19 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:54:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:54:26,340 INFO L93 Difference]: Finished difference Result 391 states and 523 transitions. [2025-03-04 02:54:26,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:54:26,343 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 134 [2025-03-04 02:54:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:54:26,349 INFO L225 Difference]: With dead ends: 391 [2025-03-04 02:54:26,350 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 02:54:26,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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:54:26,359 INFO L435 NwaCegarLoop]: 244 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, 244 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:54:26,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:54:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 02:54:26,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-03-04 02:54:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 124 states have (on average 1.1612903225806452) internal successors, (144), 125 states have internal predecessors, (144), 47 states have call successors, (47), 19 states have call predecessors, (47), 19 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 02:54:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 237 transitions. [2025-03-04 02:54:26,417 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 237 transitions. Word has length 134 [2025-03-04 02:54:26,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:54:26,419 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 237 transitions. [2025-03-04 02:54:26,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:54:26,419 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 237 transitions. [2025-03-04 02:54:26,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 02:54:26,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:26,425 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:54:26,441 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:54:26,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 02:54:26,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:26,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:26,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1481133982, now seen corresponding path program 1 times [2025-03-04 02:54:26,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:26,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368352109] [2025-03-04 02:54:26,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:26,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:30,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 02:54:30,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 02:54:30,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:30,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-04 02:54:31,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:31,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368352109] [2025-03-04 02:54:31,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368352109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:31,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:54:31,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:54:31,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885390805] [2025-03-04 02:54:31,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:31,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:54:31,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:31,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:54:31,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:54:31,755 INFO L87 Difference]: Start difference. First operand 191 states and 237 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:54:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:54:32,013 INFO L93 Difference]: Finished difference Result 345 states and 429 transitions. [2025-03-04 02:54:32,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:54:32,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 134 [2025-03-04 02:54:32,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:54:32,016 INFO L225 Difference]: With dead ends: 345 [2025-03-04 02:54:32,017 INFO L226 Difference]: Without dead ends: 196 [2025-03-04 02:54:32,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:54:32,019 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 928 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:54:32,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 928 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:54:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-04 02:54:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-03-04 02:54:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 128 states have (on average 1.15625) internal successors, (148), 129 states have internal predecessors, (148), 47 states have call successors, (47), 19 states have call predecessors, (47), 20 states have return successors, (47), 47 states have call predecessors, (47), 46 states have call successors, (47) [2025-03-04 02:54:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 242 transitions. [2025-03-04 02:54:32,037 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 242 transitions. Word has length 134 [2025-03-04 02:54:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:54:32,037 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 242 transitions. [2025-03-04 02:54:32,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:54:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 242 transitions. [2025-03-04 02:54:32,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 02:54:32,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:32,040 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:54:32,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:54:32,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:32,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:32,044 INFO L85 PathProgramCache]: Analyzing trace with hash -559455556, now seen corresponding path program 1 times [2025-03-04 02:54:32,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:32,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686738417] [2025-03-04 02:54:32,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:32,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:36,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 02:54:36,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 02:54:36,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:36,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-04 02:54:39,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:39,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686738417] [2025-03-04 02:54:39,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686738417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:39,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:54:39,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:54:39,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998890686] [2025-03-04 02:54:39,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:39,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:54:39,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:39,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:54:39,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:54:39,741 INFO L87 Difference]: Start difference. First operand 196 states and 242 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 02:54:43,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:54:43,482 INFO L93 Difference]: Finished difference Result 340 states and 427 transitions. [2025-03-04 02:54:43,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:54:43,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 140 [2025-03-04 02:54:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:54:43,486 INFO L225 Difference]: With dead ends: 340 [2025-03-04 02:54:43,486 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 02:54:43,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:54:43,487 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 53 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:54:43,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1496 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-04 02:54:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 02:54:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2025-03-04 02:54:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 132 states have (on average 1.1590909090909092) internal successors, (153), 134 states have internal predecessors, (153), 47 states have call successors, (47), 19 states have call predecessors, (47), 21 states have return successors, (50), 47 states have call predecessors, (50), 46 states have call successors, (50) [2025-03-04 02:54:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 250 transitions. [2025-03-04 02:54:43,504 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 250 transitions. Word has length 140 [2025-03-04 02:54:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:54:43,505 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 250 transitions. [2025-03-04 02:54:43,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 02:54:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 250 transitions. [2025-03-04 02:54:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 02:54:43,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:43,507 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:54:43,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:54:43,507 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:43,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:43,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1514976835, now seen corresponding path program 1 times [2025-03-04 02:54:43,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:43,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359725260] [2025-03-04 02:54:43,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:43,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:47,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 02:54:47,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 02:54:47,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:47,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-04 02:54:48,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:48,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359725260] [2025-03-04 02:54:48,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359725260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:48,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:54:48,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:54:48,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009844852] [2025-03-04 02:54:48,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:48,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:54:48,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:48,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:54:48,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:54:48,316 INFO L87 Difference]: Start difference. First operand 201 states and 250 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 02:54:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:54:48,835 INFO L93 Difference]: Finished difference Result 346 states and 436 transitions. [2025-03-04 02:54:48,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:54:48,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 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:54:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:54:48,838 INFO L225 Difference]: With dead ends: 346 [2025-03-04 02:54:48,838 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 02:54:48,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:54:48,840 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 52 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 02:54:48,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 836 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 02:54:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 02:54:48,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2025-03-04 02:54:48,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 133 states have (on average 1.1578947368421053) internal successors, (154), 135 states have internal predecessors, (154), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-04 02:54:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 253 transitions. [2025-03-04 02:54:48,862 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 253 transitions. Word has length 140 [2025-03-04 02:54:48,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:54:48,862 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 253 transitions. [2025-03-04 02:54:48,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 02:54:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 253 transitions. [2025-03-04 02:54:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 02:54:48,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:48,864 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:54:48,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:54:48,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:48,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:48,866 INFO L85 PathProgramCache]: Analyzing trace with hash -393574502, now seen corresponding path program 1 times [2025-03-04 02:54:48,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:48,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127206351] [2025-03-04 02:54:48,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:48,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:52,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 02:54:52,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 02:54:52,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:52,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-04 02:54:54,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:54,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127206351] [2025-03-04 02:54:54,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127206351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:54,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:54:54,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:54:54,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910921127] [2025-03-04 02:54:54,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:54,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:54:54,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:54,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:54:54,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:54:54,724 INFO L87 Difference]: Start difference. First operand 203 states and 253 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 02:54:55,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:54:55,526 INFO L93 Difference]: Finished difference Result 348 states and 444 transitions. [2025-03-04 02:54:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:54:55,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 146 [2025-03-04 02:54:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:54:55,529 INFO L225 Difference]: With dead ends: 348 [2025-03-04 02:54:55,531 INFO L226 Difference]: Without dead ends: 204 [2025-03-04 02:54:55,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:54:55,532 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 3 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 02:54:55,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1339 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 02:54:55,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-04 02:54:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2025-03-04 02:54:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 133 states have (on average 1.150375939849624) internal successors, (153), 135 states have internal predecessors, (153), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-04 02:54:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 252 transitions. [2025-03-04 02:54:55,549 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 252 transitions. Word has length 146 [2025-03-04 02:54:55,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:54:55,549 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 252 transitions. [2025-03-04 02:54:55,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 02:54:55,549 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 252 transitions. [2025-03-04 02:54:55,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 02:54:55,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:55,552 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:54:55,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:54:55,552 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:55,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:55,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1893965315, now seen corresponding path program 1 times [2025-03-04 02:54:55,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:55,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593366816] [2025-03-04 02:54:55,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:55,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:59,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 02:54:59,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 02:54:59,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:59,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2025-03-04 02:55:01,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:55:01,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593366816] [2025-03-04 02:55:01,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593366816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:55:01,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:55:01,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:55:01,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147495850] [2025-03-04 02:55:01,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:55:01,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:55:01,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:55:01,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:55:01,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:55:01,952 INFO L87 Difference]: Start difference. First operand 203 states and 252 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 02:55:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:55:04,596 INFO L93 Difference]: Finished difference Result 225 states and 274 transitions. [2025-03-04 02:55:04,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:55:04,600 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) Word has length 153 [2025-03-04 02:55:04,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:55:04,603 INFO L225 Difference]: With dead ends: 225 [2025-03-04 02:55:04,603 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 02:55:04,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:55:04,604 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 59 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:55:04,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1329 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-04 02:55:04,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 02:55:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-03-04 02:55:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 133 states have (on average 1.1428571428571428) internal successors, (152), 135 states have internal predecessors, (152), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-04 02:55:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2025-03-04 02:55:04,623 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 153 [2025-03-04 02:55:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:55:04,623 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2025-03-04 02:55:04,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 02:55:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2025-03-04 02:55:04,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-04 02:55:04,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:55:04,627 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:55:04,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:55:04,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:55:04,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:55:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash -589131572, now seen corresponding path program 1 times [2025-03-04 02:55:04,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:55:04,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859372742] [2025-03-04 02:55:04,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:04,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:55:08,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 02:55:08,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 02:55:08,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:08,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-04 02:55:09,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:55:09,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859372742] [2025-03-04 02:55:09,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859372742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:55:09,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:55:09,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:55:09,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830281466] [2025-03-04 02:55:09,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:55:09,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:55:09,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:55:09,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:55:09,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:55:09,814 INFO L87 Difference]: Start difference. First operand 203 states and 251 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-04 02:55:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:55:10,328 INFO L93 Difference]: Finished difference Result 314 states and 388 transitions. [2025-03-04 02:55:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:55:10,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 178 [2025-03-04 02:55:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:55:10,331 INFO L225 Difference]: With dead ends: 314 [2025-03-04 02:55:10,331 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 02:55:10,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:55:10,331 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 2 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:55:10,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 673 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 02:55:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 02:55:10,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-03-04 02:55:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 133 states have (on average 1.1353383458646618) internal successors, (151), 135 states have internal predecessors, (151), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-04 02:55:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 250 transitions. [2025-03-04 02:55:10,342 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 250 transitions. Word has length 178 [2025-03-04 02:55:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:55:10,342 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 250 transitions. [2025-03-04 02:55:10,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-04 02:55:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2025-03-04 02:55:10,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-04 02:55:10,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:55:10,345 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:55:10,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:55:10,345 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:55:10,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:55:10,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1802796208, now seen corresponding path program 1 times [2025-03-04 02:55:10,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:55:10,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573685342] [2025-03-04 02:55:10,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:10,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:55:14,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 02:55:14,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 02:55:14,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:14,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-03-04 02:55:17,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:55:17,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573685342] [2025-03-04 02:55:17,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573685342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:55:17,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579336715] [2025-03-04 02:55:17,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:17,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:55:17,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:55:17,528 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:55:17,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:55:21,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 02:55:22,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 02:55:22,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:22,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:22,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 4522 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 02:55:22,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:55:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-04 02:55:23,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:55:23,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579336715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:55:23,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:55:23,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-03-04 02:55:23,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854044982] [2025-03-04 02:55:23,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:55:23,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:55:23,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:55:23,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:55:23,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:55:23,984 INFO L87 Difference]: Start difference. First operand 203 states and 250 transitions. Second operand has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-04 02:55:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:55:25,705 INFO L93 Difference]: Finished difference Result 318 states and 393 transitions. [2025-03-04 02:55:25,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:55:25,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 187 [2025-03-04 02:55:25,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:55:25,707 INFO L225 Difference]: With dead ends: 318 [2025-03-04 02:55:25,707 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 02:55:25,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:55:25,708 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 02:55:25,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1460 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 02:55:25,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 02:55:25,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-03-04 02:55:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 138 states have internal predecessors, (153), 48 states have call successors, (48), 19 states have call predecessors, (48), 22 states have return successors, (53), 48 states have call predecessors, (53), 47 states have call successors, (53) [2025-03-04 02:55:25,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 254 transitions. [2025-03-04 02:55:25,717 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 254 transitions. Word has length 187 [2025-03-04 02:55:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:55:25,717 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 254 transitions. [2025-03-04 02:55:25,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-04 02:55:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 254 transitions. [2025-03-04 02:55:25,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-04 02:55:25,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:55:25,718 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:55:25,740 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:55:25,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 02:55:25,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:55:25,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:55:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1068371149, now seen corresponding path program 2 times [2025-03-04 02:55:25,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:55:25,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751147536] [2025-03-04 02:55:25,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:55:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:55:29,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 200 statements into 2 equivalence classes. [2025-03-04 02:55:30,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 02:55:30,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:55:30,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat