./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_OAT_nondet_test1-2.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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:42:40,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:42:40,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 08:42:40,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:42:40,609 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:42:40,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:42:40,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:42:40,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:42:40,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:42:40,623 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:42:40,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:42:40,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:42:40,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:42:40,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:42:40,624 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:42:40,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:42:40,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:42:40,624 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:42:40,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:42:40,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:42:40,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:42:40,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:42:40,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:42:40,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:42:40,625 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:42:40,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:42:40,625 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:42:40,625 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:42:40,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:42:40,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:42:40,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:42:40,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:42:40,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:42:40,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:42:40,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:42:40,626 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:42:40,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:42:40,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:42:40,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:42:40,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:42:40,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:42:40,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:42:40,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:42:40,626 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2025-02-06 08:42:40,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:42:40,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:42:40,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:42:40,844 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:42:40,844 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:42:40,846 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_OAT_nondet_test1-2.i [2025-02-06 08:42:42,000 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce2d9b346/f41b2964296f41b9b4800f0d471074d2/FLAG5608ea36e [2025-02-06 08:42:42,342 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:42:42,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2025-02-06 08:42:42,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce2d9b346/f41b2964296f41b9b4800f0d471074d2/FLAG5608ea36e [2025-02-06 08:42:42,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce2d9b346/f41b2964296f41b9b4800f0d471074d2 [2025-02-06 08:42:42,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:42:42,566 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:42:42,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:42:42,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:42:42,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:42:42,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:42:42" (1/1) ... [2025-02-06 08:42:42,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18e32bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:42, skipping insertion in model container [2025-02-06 08:42:42,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:42:42" (1/1) ... [2025-02-06 08:42:42,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:42:42,848 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_OAT_nondet_test1-2.i[33519,33532] [2025-02-06 08:42:42,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:42:42,937 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:42:42,976 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_OAT_nondet_test1-2.i[33519,33532] [2025-02-06 08:42:43,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:42:43,050 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:42:43,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:43 WrapperNode [2025-02-06 08:42:43,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:42:43,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:42:43,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:42:43,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:42:43,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:43" (1/1) ... [2025-02-06 08:42:43,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:43" (1/1) ... [2025-02-06 08:42:43,109 INFO L138 Inliner]: procedures = 176, calls = 220, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 930 [2025-02-06 08:42:43,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:42:43,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:42:43,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:42:43,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:42:43,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:43" (1/1) ... [2025-02-06 08:42:43,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:43" (1/1) ... [2025-02-06 08:42:43,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:43" (1/1) ... [2025-02-06 08:42:43,172 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2025-02-06 08:42:43,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:43" (1/1) ... [2025-02-06 08:42:43,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:43" (1/1) ... [2025-02-06 08:42:43,203 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:43" (1/1) ... [2025-02-06 08:42:43,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:43" (1/1) ... [2025-02-06 08:42:43,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:43" (1/1) ... [2025-02-06 08:42:43,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:43" (1/1) ... [2025-02-06 08:42:43,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:42:43,212 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:42:43,213 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:42:43,213 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:42:43,213 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:43" (1/1) ... [2025-02-06 08:42:43,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:42:43,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:42:43,237 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-02-06 08:42:43,244 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-02-06 08:42:43,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:42:43,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:42:43,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:42:43,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:42:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:42:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:42:43,263 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:42:43,263 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:42:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:42:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:42:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:42:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:42:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:42:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:42:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:42:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:42:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:42:43,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:42:43,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:42:43,423 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:42:43,425 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:42:44,215 INFO L? ?]: Removed 218 outVars from TransFormulas that were not future-live. [2025-02-06 08:42:44,215 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:42:44,269 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:42:44,269 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 08:42:44,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:42:44 BoogieIcfgContainer [2025-02-06 08:42:44,269 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:42:44,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:42:44,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:42:44,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:42:44,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:42:42" (1/3) ... [2025-02-06 08:42:44,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a51fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:42:44, skipping insertion in model container [2025-02-06 08:42:44,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:42:43" (2/3) ... [2025-02-06 08:42:44,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a51fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:42:44, skipping insertion in model container [2025-02-06 08:42:44,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:42:44" (3/3) ... [2025-02-06 08:42:44,278 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test1-2.i [2025-02-06 08:42:44,286 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:42:44,287 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test1-2.i that has 3 procedures, 243 locations, 1 initial locations, 25 loop locations, and 1 error locations. [2025-02-06 08:42:44,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:42:44,325 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;@6e53bc6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:42:44,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 08:42:44,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 233 states have (on average 1.6051502145922747) internal successors, (374), 234 states have internal predecessors, (374), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:42:44,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 08:42:44,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:44,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 08:42:44,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:44,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash -27275171, now seen corresponding path program 1 times [2025-02-06 08:42:44,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:44,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296453950] [2025-02-06 08:42:44,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:44,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:44,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 08:42:44,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 08:42:44,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:44,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:42:44,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:42:44,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296453950] [2025-02-06 08:42:44,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296453950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:42:44,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:42:44,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:42:44,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575854302] [2025-02-06 08:42:44,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:42:44,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:42:44,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:42:44,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:42:44,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:42:44,443 INFO L87 Difference]: Start difference. First operand has 239 states, 233 states have (on average 1.6051502145922747) internal successors, (374), 234 states have internal predecessors, (374), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-06 08:42:44,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:42:44,546 INFO L93 Difference]: Finished difference Result 668 states and 1069 transitions. [2025-02-06 08:42:44,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:42:44,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-02-06 08:42:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:42:44,553 INFO L225 Difference]: With dead ends: 668 [2025-02-06 08:42:44,553 INFO L226 Difference]: Without dead ends: 394 [2025-02-06 08:42:44,555 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-02-06 08:42:44,557 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 272 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:42:44,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 664 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:42:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-02-06 08:42:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 203. [2025-02-06 08:42:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 198 states have (on average 1.4393939393939394) internal successors, (285), 198 states have internal predecessors, (285), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:42:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 291 transitions. [2025-02-06 08:42:44,586 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 291 transitions. Word has length 6 [2025-02-06 08:42:44,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:42:44,586 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 291 transitions. [2025-02-06 08:42:44,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-06 08:42:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 291 transitions. [2025-02-06 08:42:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 08:42:44,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:44,588 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] [2025-02-06 08:42:44,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:42:44,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:44,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:44,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1241391357, now seen corresponding path program 1 times [2025-02-06 08:42:44,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:44,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460943041] [2025-02-06 08:42:44,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:44,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:44,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 08:42:44,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 08:42:44,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:44,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:42:44,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:42:44,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460943041] [2025-02-06 08:42:44,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460943041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:42:44,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:42:44,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:42:44,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779750769] [2025-02-06 08:42:44,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:42:44,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:42:44,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:42:44,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:42:44,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:42:44,974 INFO L87 Difference]: Start difference. First operand 203 states and 291 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-02-06 08:42:45,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:42:45,085 INFO L93 Difference]: Finished difference Result 406 states and 582 transitions. [2025-02-06 08:42:45,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:42:45,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 80 [2025-02-06 08:42:45,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:42:45,086 INFO L225 Difference]: With dead ends: 406 [2025-02-06 08:42:45,086 INFO L226 Difference]: Without dead ends: 206 [2025-02-06 08:42:45,087 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-02-06 08:42:45,088 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 105 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:42:45,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 639 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:42:45,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-06 08:42:45,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2025-02-06 08:42:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 198 states have (on average 1.404040404040404) internal successors, (278), 198 states have internal predecessors, (278), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:42:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 284 transitions. [2025-02-06 08:42:45,105 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 284 transitions. Word has length 80 [2025-02-06 08:42:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:42:45,106 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 284 transitions. [2025-02-06 08:42:45,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-02-06 08:42:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 284 transitions. [2025-02-06 08:42:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 08:42:45,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:45,108 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] [2025-02-06 08:42:45,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:42:45,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:45,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:45,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1924859658, now seen corresponding path program 1 times [2025-02-06 08:42:45,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:45,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948303779] [2025-02-06 08:42:45,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:45,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:45,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 08:42:45,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 08:42:45,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:45,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:42:45,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:42:45,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948303779] [2025-02-06 08:42:45,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948303779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:42:45,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:42:45,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:42:45,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392624071] [2025-02-06 08:42:45,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:42:45,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:42:45,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:42:45,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:42:45,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:42:45,289 INFO L87 Difference]: Start difference. First operand 203 states and 284 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-02-06 08:42:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:42:45,386 INFO L93 Difference]: Finished difference Result 531 states and 753 transitions. [2025-02-06 08:42:45,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:42:45,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2025-02-06 08:42:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:42:45,388 INFO L225 Difference]: With dead ends: 531 [2025-02-06 08:42:45,388 INFO L226 Difference]: Without dead ends: 331 [2025-02-06 08:42:45,388 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-02-06 08:42:45,389 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 134 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:42:45,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 512 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:42:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-02-06 08:42:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2025-02-06 08:42:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 326 states have (on average 1.4263803680981595) internal successors, (465), 326 states have internal predecessors, (465), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:42:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 471 transitions. [2025-02-06 08:42:45,403 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 471 transitions. Word has length 80 [2025-02-06 08:42:45,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:42:45,403 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 471 transitions. [2025-02-06 08:42:45,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-02-06 08:42:45,403 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 471 transitions. [2025-02-06 08:42:45,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 08:42:45,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:45,405 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] [2025-02-06 08:42:45,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:42:45,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:45,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:45,406 INFO L85 PathProgramCache]: Analyzing trace with hash -602195583, now seen corresponding path program 1 times [2025-02-06 08:42:45,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:45,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533549641] [2025-02-06 08:42:45,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:45,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:45,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 08:42:45,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 08:42:45,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:45,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:42:45,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:42:45,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533549641] [2025-02-06 08:42:45,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533549641] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:42:45,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155497454] [2025-02-06 08:42:45,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:45,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:42:45,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:42:45,675 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-02-06 08:42:45,678 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-02-06 08:42:45,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 08:42:45,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 08:42:45,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:45,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:45,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 08:42:45,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:42:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:42:46,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:42:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:42:46,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155497454] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:42:46,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:42:46,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 08:42:46,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404263683] [2025-02-06 08:42:46,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:42:46,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:42:46,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:42:46,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:42:46,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:42:46,182 INFO L87 Difference]: Start difference. First operand 331 states and 471 transitions. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:42:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:42:46,379 INFO L93 Difference]: Finished difference Result 781 states and 1104 transitions. [2025-02-06 08:42:46,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:42:46,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 95 [2025-02-06 08:42:46,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:42:46,383 INFO L225 Difference]: With dead ends: 781 [2025-02-06 08:42:46,386 INFO L226 Difference]: Without dead ends: 777 [2025-02-06 08:42:46,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 187 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-02-06 08:42:46,387 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 1418 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1426 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:42:46,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1426 Valid, 1048 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:42:46,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-02-06 08:42:46,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 777. [2025-02-06 08:42:46,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 763 states have (on average 1.4062909567496724) internal successors, (1073), 763 states have internal predecessors, (1073), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:42:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1097 transitions. [2025-02-06 08:42:46,432 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1097 transitions. Word has length 95 [2025-02-06 08:42:46,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:42:46,434 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1097 transitions. [2025-02-06 08:42:46,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:42:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1097 transitions. [2025-02-06 08:42:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-02-06 08:42:46,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:46,443 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, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:42:46,451 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-02-06 08:42:46,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:42:46,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:46,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:46,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2083545544, now seen corresponding path program 1 times [2025-02-06 08:42:46,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:46,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872566762] [2025-02-06 08:42:46,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:46,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:46,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-02-06 08:42:46,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-02-06 08:42:46,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:46,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 4 proven. 322 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-02-06 08:42:47,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:42:47,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872566762] [2025-02-06 08:42:47,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872566762] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:42:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188917665] [2025-02-06 08:42:47,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:47,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:42:47,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:42:47,374 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-02-06 08:42:47,376 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-02-06 08:42:47,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-02-06 08:42:47,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-02-06 08:42:47,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:42:47,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:42:47,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 08:42:47,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:42:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:42:48,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:42:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:42:48,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188917665] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:42:48,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:42:48,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-02-06 08:42:48,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722553560] [2025-02-06 08:42:48,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:42:48,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 08:42:48,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:42:48,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 08:42:48,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-02-06 08:42:48,541 INFO L87 Difference]: Start difference. First operand 777 states and 1097 transitions. Second operand has 16 states, 16 states have (on average 51.4375) internal successors, (823), 16 states have internal predecessors, (823), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:42:49,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:42:49,731 INFO L93 Difference]: Finished difference Result 2303 states and 3273 transitions. [2025-02-06 08:42:49,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 08:42:49,731 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 51.4375) internal successors, (823), 16 states have internal predecessors, (823), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 317 [2025-02-06 08:42:49,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:42:49,738 INFO L225 Difference]: With dead ends: 2303 [2025-02-06 08:42:49,738 INFO L226 Difference]: Without dead ends: 1849 [2025-02-06 08:42:49,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=312, Invalid=618, Unknown=0, NotChecked=0, Total=930 [2025-02-06 08:42:49,740 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 9805 mSDsluCounter, 2265 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9805 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 08:42:49,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9805 Valid, 2735 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 08:42:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2025-02-06 08:42:49,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1849. [2025-02-06 08:42:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1835 states have (on average 1.4158038147138965) internal successors, (2598), 1835 states have internal predecessors, (2598), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:42:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2622 transitions. [2025-02-06 08:42:49,816 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2622 transitions. Word has length 317 [2025-02-06 08:42:49,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:42:49,818 INFO L471 AbstractCegarLoop]: Abstraction has 1849 states and 2622 transitions. [2025-02-06 08:42:49,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.4375) internal successors, (823), 16 states have internal predecessors, (823), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:42:49,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2622 transitions. [2025-02-06 08:42:49,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2025-02-06 08:42:49,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:42:49,835 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, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:42:49,845 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-02-06 08:42:50,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:42:50,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:42:50,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:42:50,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1708710035, now seen corresponding path program 1 times [2025-02-06 08:42:50,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:42:50,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698051081] [2025-02-06 08:42:50,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:42:50,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:42:50,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 762 statements into 1 equivalence classes. [2025-02-06 08:44:00,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 762 of 762 statements. [2025-02-06 08:44:00,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:44:00,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:44:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3327 backedges. 487 proven. 3 refuted. 0 times theorem prover too weak. 2837 trivial. 0 not checked. [2025-02-06 08:44:01,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:44:01,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698051081] [2025-02-06 08:44:01,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698051081] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:44:01,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216697616] [2025-02-06 08:44:01,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:44:01,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:44:01,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:44:01,345 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-02-06 08:44:01,346 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-02-06 08:44:01,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 762 statements into 1 equivalence classes. [2025-02-06 08:44:17,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 762 of 762 statements. [2025-02-06 08:44:17,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:44:17,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:44:17,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 3879 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-06 08:44:17,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:44:17,712 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-02-06 08:44:17,742 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 18 treesize of output 7 [2025-02-06 08:44:18,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2025-02-06 08:44:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3327 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 3047 trivial. 0 not checked. [2025-02-06 08:44:18,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:44:18,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216697616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:44:18,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:44:18,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-02-06 08:44:18,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902113689] [2025-02-06 08:44:18,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:44:18,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 08:44:18,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:44:18,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 08:44:18,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-02-06 08:44:18,617 INFO L87 Difference]: Start difference. First operand 1849 states and 2622 transitions. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 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)