./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a17e1f9edfd37607fb472869452b377d4af1281c9808dec0371b4f943952037 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:54:56,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:54:56,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:54:56,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:54:56,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:54:57,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:54:57,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:54:57,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:54:57,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:54:57,032 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:54:57,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:54:57,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:54:57,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:54:57,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:54:57,034 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:54:57,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:54:57,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:54:57,034 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:54:57,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:54:57,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:54:57,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:54:57,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:54:57,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:54:57,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:54:57,035 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:54:57,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:54:57,035 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:54:57,035 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:54:57,035 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:54:57,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:54:57,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:54:57,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:54:57,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:54:57,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:54:57,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:54:57,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:54:57,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:54:57,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:54:57,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:54:57,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:54:57,036 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:54:57,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:54:57,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:54:57,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:54:57,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:54:57,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:54:57,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:54:57,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:54:57,036 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a17e1f9edfd37607fb472869452b377d4af1281c9808dec0371b4f943952037 [2025-01-09 20:54:57,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:54:57,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:54:57,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:54:57,321 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:54:57,321 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:54:57,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i [2025-01-09 20:54:58,677 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/316faca5c/70e208c37d564721bb845ae1bc385ed5/FLAGc70608897 [2025-01-09 20:54:59,018 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:54:59,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i [2025-01-09 20:54:59,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/316faca5c/70e208c37d564721bb845ae1bc385ed5/FLAGc70608897 [2025-01-09 20:54:59,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/316faca5c/70e208c37d564721bb845ae1bc385ed5 [2025-01-09 20:54:59,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:54:59,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:54:59,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:54:59,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:54:59,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:54:59,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:54:59,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f21722f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59, skipping insertion in model container [2025-01-09 20:54:59,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:54:59,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:54:59,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i[33021,33034] [2025-01-09 20:54:59,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i[49681,49694] [2025-01-09 20:54:59,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:54:59,623 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:54:59,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i[33021,33034] [2025-01-09 20:54:59,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i[49681,49694] [2025-01-09 20:54:59,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:54:59,782 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:54:59,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59 WrapperNode [2025-01-09 20:54:59,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:54:59,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:54:59,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:54:59,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:54:59,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:54:59,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:54:59,898 INFO L138 Inliner]: procedures = 177, calls = 373, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1974 [2025-01-09 20:54:59,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:54:59,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:54:59,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:54:59,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:54:59,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:54:59,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:54:59,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:55:00,034 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2025-01-09 20:55:00,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:55:00,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:55:00,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:55:00,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:55:00,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:55:00,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:55:00,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:55:00,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:55:00,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:55:00,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:55:00,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:55:00,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:55:00,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:55:00,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:55:00,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:55:00,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:55:00,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:55:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:55:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:55:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:55:00,226 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:55:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:55:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:55:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:55:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:55:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:55:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:55:00,226 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:55:00,226 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:55:00,226 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:55:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:55:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:55:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:55:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:55:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:55:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:55:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:55:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:55:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:55:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:55:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:55:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:55:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:55:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:55:00,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:55:00,435 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:55:00,437 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:55:02,445 INFO L? ?]: Removed 482 outVars from TransFormulas that were not future-live. [2025-01-09 20:55:02,446 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:55:02,479 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:55:02,482 INFO L312 CfgBuilder]: Removed 39 assume(true) statements. [2025-01-09 20:55:02,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:55:02 BoogieIcfgContainer [2025-01-09 20:55:02,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:55:02,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:55:02,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:55:02,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:55:02,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:54:59" (1/3) ... [2025-01-09 20:55:02,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451b30aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:55:02, skipping insertion in model container [2025-01-09 20:55:02,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59" (2/3) ... [2025-01-09 20:55:02,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451b30aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:55:02, skipping insertion in model container [2025-01-09 20:55:02,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:55:02" (3/3) ... [2025-01-09 20:55:02,494 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test5-1.i [2025-01-09 20:55:02,508 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:55:02,511 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test5-1.i that has 5 procedures, 572 locations, 1 initial locations, 49 loop locations, and 2 error locations. [2025-01-09 20:55:02,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:55:02,603 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;@41fdec8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:55:02,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 20:55:02,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 564 states, 548 states have (on average 1.614963503649635) internal successors, (885), 555 states have internal predecessors, (885), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:55:02,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 20:55:02,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:02,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:55:02,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:02,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:02,623 INFO L85 PathProgramCache]: Analyzing trace with hash -557051575, now seen corresponding path program 1 times [2025-01-09 20:55:02,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:02,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737256248] [2025-01-09 20:55:02,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:02,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:02,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 20:55:02,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 20:55:02,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:02,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:55:02,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:02,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737256248] [2025-01-09 20:55:02,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737256248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:02,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:02,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:55:02,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732114673] [2025-01-09 20:55:02,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:02,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:55:02,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:02,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:55:02,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:55:02,799 INFO L87 Difference]: Start difference. First operand has 564 states, 548 states have (on average 1.614963503649635) internal successors, (885), 555 states have internal predecessors, (885), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:55:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:02,868 INFO L93 Difference]: Finished difference Result 1126 states and 1817 transitions. [2025-01-09 20:55:02,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:55:02,870 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 20:55:02,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:02,884 INFO L225 Difference]: With dead ends: 1126 [2025-01-09 20:55:02,884 INFO L226 Difference]: Without dead ends: 561 [2025-01-09 20:55:02,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:55:02,894 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:02,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:55:02,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-01-09 20:55:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-01-09 20:55:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 546 states have (on average 1.4615384615384615) internal successors, (798), 552 states have internal predecessors, (798), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:55:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 820 transitions. [2025-01-09 20:55:02,979 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 820 transitions. Word has length 7 [2025-01-09 20:55:02,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:02,980 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 820 transitions. [2025-01-09 20:55:02,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:55:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 820 transitions. [2025-01-09 20:55:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 20:55:02,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:02,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:55:02,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:55:02,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:02,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:02,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1284923811, now seen corresponding path program 1 times [2025-01-09 20:55:02,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:02,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676390404] [2025-01-09 20:55:02,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:02,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:03,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 20:55:03,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 20:55:03,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:03,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:55:03,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:03,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676390404] [2025-01-09 20:55:03,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676390404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:03,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:03,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:55:03,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779918910] [2025-01-09 20:55:03,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:03,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:55:03,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:03,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:55:03,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:55:03,259 INFO L87 Difference]: Start difference. First operand 561 states and 820 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:55:03,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:03,345 INFO L93 Difference]: Finished difference Result 1283 states and 1886 transitions. [2025-01-09 20:55:03,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:55:03,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-01-09 20:55:03,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:03,353 INFO L225 Difference]: With dead ends: 1283 [2025-01-09 20:55:03,353 INFO L226 Difference]: Without dead ends: 1110 [2025-01-09 20:55:03,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:55:03,355 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 784 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:03,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1678 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:55:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-01-09 20:55:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 562. [2025-01-09 20:55:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 547 states have (on average 1.4606946983546618) internal successors, (799), 553 states have internal predecessors, (799), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:55:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 821 transitions. [2025-01-09 20:55:03,386 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 821 transitions. Word has length 60 [2025-01-09 20:55:03,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:03,386 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 821 transitions. [2025-01-09 20:55:03,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:55:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 821 transitions. [2025-01-09 20:55:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 20:55:03,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:03,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:55:03,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:55:03,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:03,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:03,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1309299646, now seen corresponding path program 1 times [2025-01-09 20:55:03,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:03,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743336958] [2025-01-09 20:55:03,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:03,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:03,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 20:55:03,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 20:55:03,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:03,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:55:04,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:04,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743336958] [2025-01-09 20:55:04,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743336958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:04,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:04,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:55:04,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936663115] [2025-01-09 20:55:04,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:04,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:55:04,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:04,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:55:04,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:55:04,086 INFO L87 Difference]: Start difference. First operand 562 states and 821 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:55:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:04,207 INFO L93 Difference]: Finished difference Result 1124 states and 1642 transitions. [2025-01-09 20:55:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:55:04,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-01-09 20:55:04,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:04,212 INFO L225 Difference]: With dead ends: 1124 [2025-01-09 20:55:04,213 INFO L226 Difference]: Without dead ends: 565 [2025-01-09 20:55:04,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:55:04,217 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 105 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:04,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2286 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:55:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-01-09 20:55:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 562. [2025-01-09 20:55:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 547 states have (on average 1.4478976234003655) internal successors, (792), 553 states have internal predecessors, (792), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:55:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 814 transitions. [2025-01-09 20:55:04,239 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 814 transitions. Word has length 204 [2025-01-09 20:55:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:04,239 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 814 transitions. [2025-01-09 20:55:04,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:55:04,240 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 814 transitions. [2025-01-09 20:55:04,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 20:55:04,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:04,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:55:04,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:55:04,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:04,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:04,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1509611978, now seen corresponding path program 1 times [2025-01-09 20:55:04,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:04,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889473984] [2025-01-09 20:55:04,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:04,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:04,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 20:55:04,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 20:55:04,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:04,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:04,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:55:04,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:04,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889473984] [2025-01-09 20:55:04,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889473984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:04,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:04,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:55:04,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228937423] [2025-01-09 20:55:04,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:04,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:55:04,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:04,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:55:04,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:55:04,591 INFO L87 Difference]: Start difference. First operand 562 states and 814 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:55:04,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:04,645 INFO L93 Difference]: Finished difference Result 1127 states and 1634 transitions. [2025-01-09 20:55:04,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:55:04,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-01-09 20:55:04,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:04,649 INFO L225 Difference]: With dead ends: 1127 [2025-01-09 20:55:04,649 INFO L226 Difference]: Without dead ends: 568 [2025-01-09 20:55:04,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:55:04,651 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 1 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:04,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1592 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:55:04,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-01-09 20:55:04,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2025-01-09 20:55:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 553 states have (on average 1.4430379746835442) internal successors, (798), 559 states have internal predecessors, (798), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:55:04,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 820 transitions. [2025-01-09 20:55:04,668 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 820 transitions. Word has length 204 [2025-01-09 20:55:04,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:04,668 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 820 transitions. [2025-01-09 20:55:04,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:55:04,669 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 820 transitions. [2025-01-09 20:55:04,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 20:55:04,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:04,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:55:04,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:55:04,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:04,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:04,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1490070856, now seen corresponding path program 1 times [2025-01-09 20:55:04,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:04,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534561889] [2025-01-09 20:55:04,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:04,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 20:55:04,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 20:55:04,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:04,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:55:04,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:04,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534561889] [2025-01-09 20:55:04,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534561889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:04,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:04,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:55:04,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964340531] [2025-01-09 20:55:04,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:04,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:55:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:04,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:55:04,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:55:04,969 INFO L87 Difference]: Start difference. First operand 568 states and 820 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:55:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:05,039 INFO L93 Difference]: Finished difference Result 1267 states and 1831 transitions. [2025-01-09 20:55:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:55:05,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-01-09 20:55:05,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:05,046 INFO L225 Difference]: With dead ends: 1267 [2025-01-09 20:55:05,046 INFO L226 Difference]: Without dead ends: 702 [2025-01-09 20:55:05,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:55:05,049 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 134 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:05,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1617 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:55:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-01-09 20:55:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-01-09 20:55:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 687 states have (on average 1.4425036390101893) internal successors, (991), 693 states have internal predecessors, (991), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:55:05,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1013 transitions. [2025-01-09 20:55:05,079 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1013 transitions. Word has length 204 [2025-01-09 20:55:05,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:05,080 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1013 transitions. [2025-01-09 20:55:05,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:55:05,080 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1013 transitions. [2025-01-09 20:55:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 20:55:05,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:05,083 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:55:05,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:55:05,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:05,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash 233025758, now seen corresponding path program 1 times [2025-01-09 20:55:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:05,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949599819] [2025-01-09 20:55:05,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:05,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:05,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 20:55:05,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 20:55:05,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:05,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:55:05,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:05,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949599819] [2025-01-09 20:55:05,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949599819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:05,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:05,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:55:05,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127229044] [2025-01-09 20:55:05,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:05,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:55:05,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:05,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:55:05,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:55:05,603 INFO L87 Difference]: Start difference. First operand 702 states and 1013 transitions. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:55:05,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:05,697 INFO L93 Difference]: Finished difference Result 1225 states and 1764 transitions. [2025-01-09 20:55:05,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:55:05,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 219 [2025-01-09 20:55:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:05,703 INFO L225 Difference]: With dead ends: 1225 [2025-01-09 20:55:05,703 INFO L226 Difference]: Without dead ends: 660 [2025-01-09 20:55:05,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:55:05,704 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 33 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:05,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2115 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:55:05,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-09 20:55:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-01-09 20:55:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 645 states have (on average 1.4170542635658914) internal successors, (914), 651 states have internal predecessors, (914), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:55:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 936 transitions. [2025-01-09 20:55:05,728 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 936 transitions. Word has length 219 [2025-01-09 20:55:05,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:05,729 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 936 transitions. [2025-01-09 20:55:05,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:55:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 936 transitions. [2025-01-09 20:55:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 20:55:05,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:05,736 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:55:05,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:55:05,737 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:05,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:05,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1941717140, now seen corresponding path program 1 times [2025-01-09 20:55:05,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:05,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454789228] [2025-01-09 20:55:05,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:05,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:05,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 20:55:05,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 20:55:05,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:05,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:55:06,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:06,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454789228] [2025-01-09 20:55:06,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454789228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:06,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:06,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:55:06,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943027829] [2025-01-09 20:55:06,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:06,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:55:06,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:06,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:55:06,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:55:06,108 INFO L87 Difference]: Start difference. First operand 660 states and 936 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:55:06,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:06,162 INFO L93 Difference]: Finished difference Result 1183 states and 1676 transitions. [2025-01-09 20:55:06,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:55:06,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 219 [2025-01-09 20:55:06,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:06,166 INFO L225 Difference]: With dead ends: 1183 [2025-01-09 20:55:06,167 INFO L226 Difference]: Without dead ends: 660 [2025-01-09 20:55:06,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:55:06,168 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 1 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:06,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1426 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:55:06,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-09 20:55:06,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-01-09 20:55:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 645 states have (on average 1.4124031007751938) internal successors, (911), 651 states have internal predecessors, (911), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:55:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 933 transitions. [2025-01-09 20:55:06,188 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 933 transitions. Word has length 219 [2025-01-09 20:55:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:06,189 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 933 transitions. [2025-01-09 20:55:06,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:55:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 933 transitions. [2025-01-09 20:55:06,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 20:55:06,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:06,193 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:55:06,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:55:06,193 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:06,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:06,194 INFO L85 PathProgramCache]: Analyzing trace with hash 81701864, now seen corresponding path program 1 times [2025-01-09 20:55:06,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:06,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174288968] [2025-01-09 20:55:06,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:06,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:06,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 20:55:06,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 20:55:06,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:06,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:55:06,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:06,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174288968] [2025-01-09 20:55:06,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174288968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:06,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:06,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:55:06,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85201298] [2025-01-09 20:55:06,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:06,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:55:06,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:06,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:55:06,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:55:06,525 INFO L87 Difference]: Start difference. First operand 660 states and 933 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:55:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:06,600 INFO L93 Difference]: Finished difference Result 1474 states and 2087 transitions. [2025-01-09 20:55:06,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:55:06,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 219 [2025-01-09 20:55:06,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:06,608 INFO L225 Difference]: With dead ends: 1474 [2025-01-09 20:55:06,609 INFO L226 Difference]: Without dead ends: 951 [2025-01-09 20:55:06,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:55:06,611 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 454 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:06,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1638 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:55:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-01-09 20:55:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 949. [2025-01-09 20:55:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 926 states have (on average 1.4136069114470842) internal successors, (1309), 937 states have internal predecessors, (1309), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:55:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1347 transitions. [2025-01-09 20:55:06,641 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1347 transitions. Word has length 219 [2025-01-09 20:55:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:06,641 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1347 transitions. [2025-01-09 20:55:06,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:55:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1347 transitions. [2025-01-09 20:55:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 20:55:06,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:06,644 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:55:06,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:55:06,645 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:06,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:06,646 INFO L85 PathProgramCache]: Analyzing trace with hash 934357344, now seen corresponding path program 1 times [2025-01-09 20:55:06,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:06,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006199967] [2025-01-09 20:55:06,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:06,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:06,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:55:06,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:55:06,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:06,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:55:07,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:07,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006199967] [2025-01-09 20:55:07,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006199967] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:55:07,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568612150] [2025-01-09 20:55:07,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:07,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:55:07,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:55:07,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:55:07,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 20:55:07,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:55:07,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:55:07,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:07,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:07,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 20:55:07,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:55:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 20:55:07,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:55:07,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568612150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:07,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:55:07,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 20:55:07,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243751551] [2025-01-09 20:55:07,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:07,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:55:07,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:07,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:55:07,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:55:07,727 INFO L87 Difference]: Start difference. First operand 949 states and 1347 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:55:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:07,820 INFO L93 Difference]: Finished difference Result 1306 states and 1885 transitions. [2025-01-09 20:55:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:55:07,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 234 [2025-01-09 20:55:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:07,827 INFO L225 Difference]: With dead ends: 1306 [2025-01-09 20:55:07,828 INFO L226 Difference]: Without dead ends: 989 [2025-01-09 20:55:07,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:55:07,830 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 8 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:07,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1405 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:55:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-01-09 20:55:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2025-01-09 20:55:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 966 states have (on average 1.39648033126294) internal successors, (1349), 977 states have internal predecessors, (1349), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:55:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1387 transitions. [2025-01-09 20:55:07,881 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1387 transitions. Word has length 234 [2025-01-09 20:55:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:07,881 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1387 transitions. [2025-01-09 20:55:07,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:55:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1387 transitions. [2025-01-09 20:55:07,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 20:55:07,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:07,885 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:55:07,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 20:55:08,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:55:08,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:08,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:08,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1963716642, now seen corresponding path program 1 times [2025-01-09 20:55:08,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:08,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862615616] [2025-01-09 20:55:08,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:08,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:08,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:55:08,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:55:08,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:08,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:55:08,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:08,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862615616] [2025-01-09 20:55:08,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862615616] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:55:08,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832658144] [2025-01-09 20:55:08,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:08,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:55:08,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:55:08,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:55:08,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 20:55:08,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:55:09,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:55:09,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:09,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:09,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 20:55:09,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:55:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 20:55:09,196 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:55:09,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832658144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:09,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:55:09,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 20:55:09,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368695727] [2025-01-09 20:55:09,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:09,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:55:09,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:09,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:55:09,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:55:09,198 INFO L87 Difference]: Start difference. First operand 989 states and 1387 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:55:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:09,291 INFO L93 Difference]: Finished difference Result 1318 states and 1877 transitions. [2025-01-09 20:55:09,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:55:09,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 234 [2025-01-09 20:55:09,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:09,298 INFO L225 Difference]: With dead ends: 1318 [2025-01-09 20:55:09,298 INFO L226 Difference]: Without dead ends: 961 [2025-01-09 20:55:09,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:55:09,301 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 106 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:09,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 2016 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:55:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2025-01-09 20:55:09,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2025-01-09 20:55:09,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 938 states have (on average 1.3933901918976546) internal successors, (1307), 949 states have internal predecessors, (1307), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:55:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1345 transitions. [2025-01-09 20:55:09,333 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1345 transitions. Word has length 234 [2025-01-09 20:55:09,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:09,333 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1345 transitions. [2025-01-09 20:55:09,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:55:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1345 transitions. [2025-01-09 20:55:09,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 20:55:09,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:09,336 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:55:09,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 20:55:09,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:55:09,541 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:09,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:09,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1608964078, now seen corresponding path program 1 times [2025-01-09 20:55:09,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:09,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104057999] [2025-01-09 20:55:09,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:09,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:09,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:55:09,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:55:09,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:09,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:55:09,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:09,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104057999] [2025-01-09 20:55:09,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104057999] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:55:09,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436854854] [2025-01-09 20:55:09,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:09,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:55:09,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:55:09,898 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:55:09,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 20:55:10,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:55:10,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:55:10,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:10,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:10,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 20:55:10,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:55:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 20:55:10,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:55:10,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436854854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:10,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:55:10,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 20:55:10,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333540798] [2025-01-09 20:55:10,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:10,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:55:10,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:10,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:55:10,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:55:10,499 INFO L87 Difference]: Start difference. First operand 961 states and 1345 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:55:10,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:10,577 INFO L93 Difference]: Finished difference Result 1182 states and 1653 transitions. [2025-01-09 20:55:10,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:55:10,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 234 [2025-01-09 20:55:10,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:10,582 INFO L225 Difference]: With dead ends: 1182 [2025-01-09 20:55:10,582 INFO L226 Difference]: Without dead ends: 853 [2025-01-09 20:55:10,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:55:10,585 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 9 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:10,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1865 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:55:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-01-09 20:55:10,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2025-01-09 20:55:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 830 states have (on average 1.3674698795180722) internal successors, (1135), 841 states have internal predecessors, (1135), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:55:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1173 transitions. [2025-01-09 20:55:10,612 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1173 transitions. Word has length 234 [2025-01-09 20:55:10,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:10,613 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1173 transitions. [2025-01-09 20:55:10,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:55:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1173 transitions. [2025-01-09 20:55:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 20:55:10,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:10,616 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:55:10,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 20:55:10,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:55:10,817 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:10,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:10,817 INFO L85 PathProgramCache]: Analyzing trace with hash -579604780, now seen corresponding path program 1 times [2025-01-09 20:55:10,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:10,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431109243] [2025-01-09 20:55:10,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:10,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:10,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:55:10,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:55:10,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:10,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:55:11,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:11,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431109243] [2025-01-09 20:55:11,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431109243] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:55:11,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736794286] [2025-01-09 20:55:11,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:11,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:55:11,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:55:11,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:55:11,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 20:55:11,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:55:11,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:55:11,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:11,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:11,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 20:55:11,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:55:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:55:11,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:55:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:55:12,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736794286] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:55:12,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:55:12,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 20:55:12,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067846052] [2025-01-09 20:55:12,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:55:12,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:55:12,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:12,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:55:12,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:55:12,222 INFO L87 Difference]: Start difference. First operand 853 states and 1173 transitions. Second operand has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:55:12,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:12,401 INFO L93 Difference]: Finished difference Result 2180 states and 3005 transitions. [2025-01-09 20:55:12,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:55:12,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 234 [2025-01-09 20:55:12,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:12,413 INFO L225 Difference]: With dead ends: 2180 [2025-01-09 20:55:12,413 INFO L226 Difference]: Without dead ends: 1959 [2025-01-09 20:55:12,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:55:12,415 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 2625 mSDsluCounter, 2352 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2656 SdHoareTripleChecker+Valid, 3079 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:12,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2656 Valid, 3079 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:55:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2025-01-09 20:55:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1608. [2025-01-09 20:55:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1570 states have (on average 1.3617834394904458) internal successors, (2138), 1581 states have internal predecessors, (2138), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 26 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 20:55:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2206 transitions. [2025-01-09 20:55:12,472 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2206 transitions. Word has length 234 [2025-01-09 20:55:12,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:12,472 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2206 transitions. [2025-01-09 20:55:12,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:55:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2206 transitions. [2025-01-09 20:55:12,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-01-09 20:55:12,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:12,490 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:55:12,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 20:55:12,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 20:55:12,692 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:12,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:12,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1075608289, now seen corresponding path program 1 times [2025-01-09 20:55:12,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:12,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120054765] [2025-01-09 20:55:12,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:12,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-01-09 20:55:13,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-01-09 20:55:13,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:13,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 4 proven. 526 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-09 20:55:14,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:14,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120054765] [2025-01-09 20:55:14,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120054765] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:55:14,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588111220] [2025-01-09 20:55:14,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:14,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:55:14,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:55:14,158 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:55:14,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 20:55:14,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-01-09 20:55:15,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-01-09 20:55:15,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:15,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:15,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 3255 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 20:55:15,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:55:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:55:16,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:55:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:55:16,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588111220] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:55:16,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:55:16,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-01-09 20:55:16,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354299535] [2025-01-09 20:55:16,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:55:16,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 20:55:16,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:16,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 20:55:16,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-01-09 20:55:16,822 INFO L87 Difference]: Start difference. First operand 1608 states and 2206 transitions. Second operand has 16 states, 16 states have (on average 102.6875) internal successors, (1643), 16 states have internal predecessors, (1643), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 20:55:26,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:26,182 INFO L93 Difference]: Finished difference Result 14778 states and 20405 transitions. [2025-01-09 20:55:26,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 20:55:26,184 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 102.6875) internal successors, (1643), 16 states have internal predecessors, (1643), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 666 [2025-01-09 20:55:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:26,245 INFO L225 Difference]: With dead ends: 14778 [2025-01-09 20:55:26,246 INFO L226 Difference]: Without dead ends: 13798 [2025-01-09 20:55:26,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1390 GetRequests, 1322 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1240, Invalid=3590, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 20:55:26,255 INFO L435 NwaCegarLoop]: 1426 mSDtfsCounter, 29716 mSDsluCounter, 13226 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29716 SdHoareTripleChecker+Valid, 14652 SdHoareTripleChecker+Invalid, 2809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:26,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29716 Valid, 14652 Invalid, 2809 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [323 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2025-01-09 20:55:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13798 states. [2025-01-09 20:55:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13798 to 9335. [2025-01-09 20:55:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9335 states, 9205 states have (on average 1.367191743617599) internal successors, (12585), 9221 states have internal predecessors, (12585), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 114 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 20:55:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9335 states to 9335 states and 12837 transitions. [2025-01-09 20:55:26,582 INFO L78 Accepts]: Start accepts. Automaton has 9335 states and 12837 transitions. Word has length 666 [2025-01-09 20:55:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:26,583 INFO L471 AbstractCegarLoop]: Abstraction has 9335 states and 12837 transitions. [2025-01-09 20:55:26,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 102.6875) internal successors, (1643), 16 states have internal predecessors, (1643), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 20:55:26,584 INFO L276 IsEmpty]: Start isEmpty. Operand 9335 states and 12837 transitions. [2025-01-09 20:55:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1541 [2025-01-09 20:55:26,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:26,616 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:55:26,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 20:55:26,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 20:55:26,817 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:26,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:26,819 INFO L85 PathProgramCache]: Analyzing trace with hash 610687114, now seen corresponding path program 1 times [2025-01-09 20:55:26,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:26,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222244686] [2025-01-09 20:55:26,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:26,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:27,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1540 statements into 1 equivalence classes.