./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:16:54,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:16:54,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:16:54,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:16:54,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:16:54,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:16:54,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:16:54,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:16:54,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:16:54,909 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:16:54,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:16:54,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:16:54,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:16:54,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:16:54,910 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:16:54,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:16:54,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:16:54,911 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:16:54,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:16:54,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:16:54,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:16:54,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:16:54,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:16:54,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:16:54,911 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:16:54,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:16:54,911 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:16:54,912 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:16:54,912 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:16:54,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:16:54,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:16:54,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:16:54,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:16:54,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:16:54,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:16:54,912 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:16:54,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:16:54,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:16:54,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:16:54,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:16:54,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:16:54,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:16:54,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:16:54,913 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 [2025-03-03 13:16:55,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:16:55,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:16:55,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:16:55,133 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:16:55,133 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:16:55,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2025-03-03 13:16:56,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71856edfa/fe880ae5e4b24811864ea2e187be4b93/FLAGfc687e55c [2025-03-03 13:16:56,559 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:16:56,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2025-03-03 13:16:56,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71856edfa/fe880ae5e4b24811864ea2e187be4b93/FLAGfc687e55c [2025-03-03 13:16:56,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71856edfa/fe880ae5e4b24811864ea2e187be4b93 [2025-03-03 13:16:56,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:16:56,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:16:56,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:16:56,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:16:56,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:16:56,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:16:56" (1/1) ... [2025-03-03 13:16:56,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c85c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:56, skipping insertion in model container [2025-03-03 13:16:56,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:16:56" (1/1) ... [2025-03-03 13:16:56,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:16:56,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2025-03-03 13:16:56,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:16:56,895 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:16:56,914 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2025-03-03 13:16:56,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:16:56,955 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:16:56,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:56 WrapperNode [2025-03-03 13:16:56,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:16:56,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:16:56,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:16:56,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:16:56,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:56" (1/1) ... [2025-03-03 13:16:56,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:56" (1/1) ... [2025-03-03 13:16:56,990 INFO L138 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 199 [2025-03-03 13:16:56,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:16:56,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:16:56,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:16:56,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:16:56,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:56" (1/1) ... [2025-03-03 13:16:56,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:56" (1/1) ... [2025-03-03 13:16:57,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:56" (1/1) ... [2025-03-03 13:16:57,025 INFO L175 MemorySlicer]: Split 48 memory accesses to 3 slices as follows [2, 40, 6]. 83 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 13 writes are split as follows [0, 11, 2]. [2025-03-03 13:16:57,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:56" (1/1) ... [2025-03-03 13:16:57,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:56" (1/1) ... [2025-03-03 13:16:57,032 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:56" (1/1) ... [2025-03-03 13:16:57,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:56" (1/1) ... [2025-03-03 13:16:57,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:56" (1/1) ... [2025-03-03 13:16:57,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:56" (1/1) ... [2025-03-03 13:16:57,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:16:57,038 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:16:57,038 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:16:57,038 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:16:57,039 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:56" (1/1) ... [2025-03-03 13:16:57,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:16:57,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:16:57,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 13:16:57,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 13:16:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-03-03 13:16:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-03-03 13:16:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2025-03-03 13:16:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2025-03-03 13:16:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 13:16:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:16:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2025-03-03 13:16:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2025-03-03 13:16:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 13:16:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 13:16:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 13:16:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 13:16:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-03 13:16:57,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-03 13:16:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 13:16:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 13:16:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 13:16:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 13:16:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 13:16:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 13:16:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 13:16:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2025-03-03 13:16:57,082 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2025-03-03 13:16:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2025-03-03 13:16:57,082 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2025-03-03 13:16:57,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:16:57,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:16:57,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 13:16:57,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:16:57,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:16:57,186 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:16:57,187 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:16:57,202 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: havoc #t~ret12.base, #t~ret12.offset; [2025-03-03 13:16:57,270 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L593: havoc #t~mem11.base, #t~mem11.offset;call ULTIMATE.dealloc(~#dll~0.base, ~#dll~0.offset);havoc ~#dll~0.base, ~#dll~0.offset; [2025-03-03 13:16:57,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L641: havoc dll_create_master_#t~ret21#1.base, dll_create_master_#t~ret21#1.offset; [2025-03-03 13:16:57,488 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2025-03-03 13:16:57,488 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:16:57,500 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:16:57,500 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:16:57,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:16:57 BoogieIcfgContainer [2025-03-03 13:16:57,501 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:16:57,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:16:57,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:16:57,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:16:57,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:16:56" (1/3) ... [2025-03-03 13:16:57,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd816c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:16:57, skipping insertion in model container [2025-03-03 13:16:57,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:56" (2/3) ... [2025-03-03 13:16:57,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd816c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:16:57, skipping insertion in model container [2025-03-03 13:16:57,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:16:57" (3/3) ... [2025-03-03 13:16:57,508 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2025-03-03 13:16:57,520 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:16:57,521 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_of_dll-2.i that has 7 procedures, 127 locations, 1 initial locations, 24 loop locations, and 1 error locations. [2025-03-03 13:16:57,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:16:57,573 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;@4883e748, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:16:57,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:16:57,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 95 states have (on average 1.6210526315789473) internal successors, (154), 115 states have internal predecessors, (154), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 13:16:57,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 13:16:57,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:16:57,582 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:16:57,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:16:57,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:16:57,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1954975430, now seen corresponding path program 1 times [2025-03-03 13:16:57,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:16:57,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395439932] [2025-03-03 13:16:57,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:16:57,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:16:57,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 13:16:57,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:16:57,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:16:57,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:16:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:16:57,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:16:57,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395439932] [2025-03-03 13:16:57,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395439932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:16:57,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726123224] [2025-03-03 13:16:57,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:16:57,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:16:57,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:16:57,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:16:57,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 13:16:57,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 13:16:57,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:16:57,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:16:57,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:16:57,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 13:16:57,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:16:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 13:16:57,994 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:16:57,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726123224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:16:57,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:16:57,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 13:16:57,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750355001] [2025-03-03 13:16:57,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:16:58,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:16:58,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:16:58,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:16:58,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:16:58,019 INFO L87 Difference]: Start difference. First operand has 127 states, 95 states have (on average 1.6210526315789473) internal successors, (154), 115 states have internal predecessors, (154), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:16:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:16:58,051 INFO L93 Difference]: Finished difference Result 249 states and 409 transitions. [2025-03-03 13:16:58,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:16:58,052 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-03 13:16:58,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:16:58,058 INFO L225 Difference]: With dead ends: 249 [2025-03-03 13:16:58,059 INFO L226 Difference]: Without dead ends: 119 [2025-03-03 13:16:58,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:16:58,065 INFO L435 NwaCegarLoop]: 155 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, 155 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-03-03 13:16:58,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:16:58,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-03 13:16:58,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-03 13:16:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 107 states have internal predecessors, (114), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 13:16:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 148 transitions. [2025-03-03 13:16:58,104 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 148 transitions. Word has length 37 [2025-03-03 13:16:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:16:58,104 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 148 transitions. [2025-03-03 13:16:58,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:16:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 148 transitions. [2025-03-03 13:16:58,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:16:58,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:16:58,106 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:16:58,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 13:16:58,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 13:16:58,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:16:58,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:16:58,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2067303042, now seen corresponding path program 1 times [2025-03-03 13:16:58,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:16:58,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544365499] [2025-03-03 13:16:58,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:16:58,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:16:58,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:16:58,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:16:58,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:16:58,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:16:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:16:58,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:16:58,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544365499] [2025-03-03 13:16:58,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544365499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:16:58,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510205734] [2025-03-03 13:16:58,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:16:58,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:16:58,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:16:58,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:16:58,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:16:59,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:16:59,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:16:59,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:16:59,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:16:59,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 13:16:59,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:16:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:16:59,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:16:59,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510205734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:16:59,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:16:59,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-03 13:16:59,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849583773] [2025-03-03 13:16:59,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:16:59,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:16:59,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:16:59,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:16:59,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:16:59,207 INFO L87 Difference]: Start difference. First operand 119 states and 148 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:16:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:16:59,290 INFO L93 Difference]: Finished difference Result 248 states and 322 transitions. [2025-03-03 13:16:59,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:16:59,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2025-03-03 13:16:59,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:16:59,294 INFO L225 Difference]: With dead ends: 248 [2025-03-03 13:16:59,294 INFO L226 Difference]: Without dead ends: 132 [2025-03-03 13:16:59,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:16:59,295 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 14 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:16:59,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 550 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:16:59,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-03 13:16:59,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-03 13:16:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 97 states have (on average 1.268041237113402) internal successors, (123), 115 states have internal predecessors, (123), 27 states have call successors, (27), 8 states have call predecessors, (27), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 13:16:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2025-03-03 13:16:59,308 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 38 [2025-03-03 13:16:59,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:16:59,308 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2025-03-03 13:16:59,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:16:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2025-03-03 13:16:59,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 13:16:59,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:16:59,310 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:16:59,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:16:59,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 13:16:59,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:16:59,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:16:59,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2078697854, now seen corresponding path program 1 times [2025-03-03 13:16:59,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:16:59,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697201216] [2025-03-03 13:16:59,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:16:59,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:16:59,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 13:16:59,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 13:16:59,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:16:59,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 13:17:00,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:00,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697201216] [2025-03-03 13:17:00,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697201216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:00,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331106272] [2025-03-03 13:17:00,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:00,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:00,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:17:00,433 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:17:00,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:17:00,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 13:17:00,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 13:17:00,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:00,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:00,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-03 13:17:00,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:17:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 13:17:00,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:17:00,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331106272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:17:00,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:17:00,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 13 [2025-03-03 13:17:00,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814702314] [2025-03-03 13:17:00,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:17:00,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 13:17:00,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:00,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 13:17:00,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:17:00,785 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 13:17:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:01,067 INFO L93 Difference]: Finished difference Result 263 states and 332 transitions. [2025-03-03 13:17:01,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:17:01,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2025-03-03 13:17:01,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:01,068 INFO L225 Difference]: With dead ends: 263 [2025-03-03 13:17:01,068 INFO L226 Difference]: Without dead ends: 136 [2025-03-03 13:17:01,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:17:01,069 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 47 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:01,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 562 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:17:01,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-03 13:17:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-03 13:17:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 100 states have (on average 1.26) internal successors, (126), 119 states have internal predecessors, (126), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (15), 11 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-03 13:17:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 168 transitions. [2025-03-03 13:17:01,082 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 168 transitions. Word has length 110 [2025-03-03 13:17:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:01,082 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 168 transitions. [2025-03-03 13:17:01,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 13:17:01,083 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 168 transitions. [2025-03-03 13:17:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 13:17:01,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:01,084 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:01,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:17:01,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:01,288 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:01,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:01,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1793174366, now seen corresponding path program 1 times [2025-03-03 13:17:01,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:01,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106002141] [2025-03-03 13:17:01,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:01,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:01,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 13:17:01,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 13:17:01,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:01,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 13:17:01,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:01,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106002141] [2025-03-03 13:17:01,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106002141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:01,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174576213] [2025-03-03 13:17:01,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:01,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:01,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:17:01,918 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:17:01,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:17:02,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 13:17:02,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 13:17:02,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:02,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:02,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-03 13:17:02,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:17:02,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 13:17:02,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-03 13:17:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-03 13:17:02,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:17:02,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-03-03 13:17:02,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-03-03 13:17:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 13:17:02,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174576213] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:17:02,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:17:02,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 15] total 25 [2025-03-03 13:17:02,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100916259] [2025-03-03 13:17:02,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:17:02,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 13:17:02,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:02,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 13:17:02,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2025-03-03 13:17:02,811 INFO L87 Difference]: Start difference. First operand 136 states and 168 transitions. Second operand has 25 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-03 13:17:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:03,900 INFO L93 Difference]: Finished difference Result 349 states and 433 transitions. [2025-03-03 13:17:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 13:17:03,901 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 110 [2025-03-03 13:17:03,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:03,903 INFO L225 Difference]: With dead ends: 349 [2025-03-03 13:17:03,904 INFO L226 Difference]: Without dead ends: 205 [2025-03-03 13:17:03,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=1693, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 13:17:03,906 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 176 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:03,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1994 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 13:17:03,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-03 13:17:03,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 174. [2025-03-03 13:17:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 133 states have (on average 1.2330827067669172) internal successors, (164), 151 states have internal predecessors, (164), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (17), 13 states have call predecessors, (17), 15 states have call successors, (17) [2025-03-03 13:17:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 210 transitions. [2025-03-03 13:17:03,921 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 210 transitions. Word has length 110 [2025-03-03 13:17:03,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:03,922 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 210 transitions. [2025-03-03 13:17:03,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-03 13:17:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 210 transitions. [2025-03-03 13:17:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 13:17:03,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:03,924 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:17:03,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 13:17:04,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:04,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:04,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:04,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1063995117, now seen corresponding path program 1 times [2025-03-03 13:17:04,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:04,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138042322] [2025-03-03 13:17:04,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:04,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:04,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 13:17:04,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 13:17:04,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:04,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 13:17:10,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:10,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138042322] [2025-03-03 13:17:10,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138042322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:10,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069765733] [2025-03-03 13:17:10,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:10,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:10,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:17:10,718 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:17:10,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:17:10,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 13:17:10,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 13:17:10,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:10,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:10,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 208 conjuncts are in the unsatisfiable core [2025-03-03 13:17:10,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:17:11,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 13:17:11,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 13:17:11,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-03 13:17:11,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:17:11,638 INFO L349 Elim1Store]: treesize reduction 33, result has 38.9 percent of original size [2025-03-03 13:17:11,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 29 [2025-03-03 13:17:11,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 13:17:20,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 76 [2025-03-03 13:17:21,951 INFO L349 Elim1Store]: treesize reduction 105, result has 16.0 percent of original size [2025-03-03 13:17:21,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 104 treesize of output 138 [2025-03-03 13:17:22,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:22,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 189 [2025-03-03 13:17:25,406 INFO L349 Elim1Store]: treesize reduction 131, result has 3.7 percent of original size [2025-03-03 13:17:25,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 67 treesize of output 43 [2025-03-03 13:17:25,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:17:25,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 13:17:25,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2025-03-03 13:17:26,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-03 13:17:26,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2025-03-03 13:17:26,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-03 13:17:31,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-03 13:17:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 50 proven. 79 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 13:17:31,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:17:35,039 INFO L349 Elim1Store]: treesize reduction 21, result has 67.2 percent of original size [2025-03-03 13:17:35,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 57 [2025-03-03 13:17:35,046 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 13:17:35,047 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 13:17:35,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2025-03-03 13:17:35,106 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-03 13:17:35,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 150 [2025-03-03 13:17:36,796 INFO L349 Elim1Store]: treesize reduction 263, result has 46.2 percent of original size [2025-03-03 13:17:36,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41854 treesize of output 30070 [2025-03-03 13:17:36,847 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 13:17:36,849 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 13:17:36,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:36,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1826 treesize of output 1832 [2025-03-03 13:17:36,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1960 treesize of output 1836 [2025-03-03 13:17:36,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2432 treesize of output 2268 [2025-03-03 13:17:37,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:37,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1661 treesize of output 1662 [2025-03-03 13:17:37,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:37,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1653 treesize of output 1646 [2025-03-03 13:17:37,264 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-03 13:17:37,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 155 [2025-03-03 13:17:39,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-03 13:17:39,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:17:39,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 180 [2025-03-03 13:17:40,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2025-03-03 13:17:40,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-03 13:17:40,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-03-03 13:17:41,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2025-03-03 13:17:41,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:17:41,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:17:41,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2025-03-03 13:17:42,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069765733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:42,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:17:42,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 44] total 77 [2025-03-03 13:17:42,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038438511] [2025-03-03 13:17:42,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:17:42,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-03-03 13:17:42,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:42,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-03-03 13:17:42,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=6513, Unknown=3, NotChecked=0, Total=6806 [2025-03-03 13:17:42,445 INFO L87 Difference]: Start difference. First operand 174 states and 210 transitions. Second operand has 77 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 63 states have internal predecessors, (136), 19 states have call successors, (22), 8 states have call predecessors, (22), 19 states have return successors, (26), 21 states have call predecessors, (26), 16 states have call successors, (26) [2025-03-03 13:17:54,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:18:08,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:18:13,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:18:19,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]