./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/uthash-2.0.2/uthash_SAX_test1-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 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:33:45,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:33:45,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:33:45,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:33:45,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:33:45,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:33:45,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:33:45,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:33:45,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:33:45,835 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:33:45,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:33:45,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:33:45,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:33:45,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:33:45,836 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:33:45,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:33:45,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:33:45,837 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:33:45,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:33:45,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:33:45,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:33:45,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:33:45,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:33:45,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:33:45,837 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:33:45,837 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:33:45,837 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:33:45,838 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:33:45,838 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:33:45,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:33:45,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:33:45,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:33:45,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:33:45,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:33:45,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:33:45,839 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:33:45,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:33:45,839 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:33:45,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:33:45,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:33:45,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:33:45,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:33:45,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:33:45,839 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 -> 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 [2025-03-17 10:33:46,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:33:46,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:33:46,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:33:46,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:33:46,059 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:33:46,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2025-03-17 10:33:47,239 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7654beac1/e9a4f5dae99c49cca8ad2620802e8473/FLAG2a838112b [2025-03-17 10:33:47,531 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:33:47,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2025-03-17 10:33:47,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7654beac1/e9a4f5dae99c49cca8ad2620802e8473/FLAG2a838112b [2025-03-17 10:33:47,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7654beac1/e9a4f5dae99c49cca8ad2620802e8473 [2025-03-17 10:33:47,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:33:47,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:33:47,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:33:47,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:33:47,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:33:47,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:33:47" (1/1) ... [2025-03-17 10:33:47,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c9b34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:33:47, skipping insertion in model container [2025-03-17 10:33:47,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:33:47" (1/1) ... [2025-03-17 10:33:47,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:33:47,884 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/uthash-2.0.2/uthash_SAX_test1-2.i[33021,33034] [2025-03-17 10:33:47,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:33:47,969 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:33:48,001 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/uthash-2.0.2/uthash_SAX_test1-2.i[33021,33034] [2025-03-17 10:33:48,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:33:48,067 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:33:48,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:33:48 WrapperNode [2025-03-17 10:33:48,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:33:48,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:33:48,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:33:48,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:33:48,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:33:48" (1/1) ... [2025-03-17 10:33:48,084 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:33:48" (1/1) ... [2025-03-17 10:33:48,111 INFO L138 Inliner]: procedures = 176, calls = 230, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 971 [2025-03-17 10:33:48,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:33:48,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:33:48,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:33:48,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:33:48,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:33:48" (1/1) ... [2025-03-17 10:33:48,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:33:48" (1/1) ... [2025-03-17 10:33:48,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:33:48" (1/1) ... [2025-03-17 10:33:48,184 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-03-17 10:33:48,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:33:48" (1/1) ... [2025-03-17 10:33:48,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:33:48" (1/1) ... [2025-03-17 10:33:48,215 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:33:48" (1/1) ... [2025-03-17 10:33:48,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:33:48" (1/1) ... [2025-03-17 10:33:48,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:33:48" (1/1) ... [2025-03-17 10:33:48,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:33:48" (1/1) ... [2025-03-17 10:33:48,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:33:48,235 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:33:48,235 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:33:48,235 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:33:48,236 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:33:48" (1/1) ... [2025-03-17 10:33:48,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:33:48,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:33:48,260 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-17 10:33:48,264 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-17 10:33:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:33:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:33:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 10:33:48,283 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 10:33:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:33:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:33:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:33:48,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:33:48,284 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:33:48,284 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:33:48,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:33:48,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:33:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:33:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:33:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:33:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:33:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:33:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:33:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:33:48,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:33:48,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:33:48,435 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:33:48,437 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:33:49,274 INFO L? ?]: Removed 228 outVars from TransFormulas that were not future-live. [2025-03-17 10:33:49,274 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:33:49,335 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:33:49,335 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 10:33:49,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:33:49 BoogieIcfgContainer [2025-03-17 10:33:49,335 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:33:49,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:33:49,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:33:49,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:33:49,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:33:47" (1/3) ... [2025-03-17 10:33:49,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687c1ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:33:49, skipping insertion in model container [2025-03-17 10:33:49,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:33:48" (2/3) ... [2025-03-17 10:33:49,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687c1ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:33:49, skipping insertion in model container [2025-03-17 10:33:49,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:33:49" (3/3) ... [2025-03-17 10:33:49,346 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test1-2.i [2025-03-17 10:33:49,356 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:33:49,358 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test1-2.i that has 4 procedures, 263 locations, 1 initial locations, 24 loop locations, and 1 error locations. [2025-03-17 10:33:49,409 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:33:49,418 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;@5ccdfedb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:33:49,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 10:33:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 242 states have (on average 1.6239669421487604) internal successors, (393), 253 states have internal predecessors, (393), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:33:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 10:33:49,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:33:49,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:33:49,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:33:49,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:33:49,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1369399778, now seen corresponding path program 1 times [2025-03-17 10:33:49,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:33:49,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504784518] [2025-03-17 10:33:49,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:33:49,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:33:49,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 10:33:49,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 10:33:49,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:33:49,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:33:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:33:49,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:33:49,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504784518] [2025-03-17 10:33:49,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504784518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:33:49,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:33:49,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:33:49,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410150102] [2025-03-17 10:33:49,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:33:49,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:33:49,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:33:49,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:33:49,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:33:49,582 INFO L87 Difference]: Start difference. First operand has 259 states, 242 states have (on average 1.6239669421487604) internal successors, (393), 253 states have internal predecessors, (393), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:33:49,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:33:49,729 INFO L93 Difference]: Finished difference Result 708 states and 1157 transitions. [2025-03-17 10:33:49,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:33:49,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 10:33:49,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:33:49,742 INFO L225 Difference]: With dead ends: 708 [2025-03-17 10:33:49,742 INFO L226 Difference]: Without dead ends: 415 [2025-03-17 10:33:49,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-17 10:33:49,749 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 271 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 742 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-03-17 10:33:49,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 742 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:33:49,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-17 10:33:49,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 225. [2025-03-17 10:33:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 209 states have (on average 1.4641148325358853) internal successors, (306), 219 states have internal predecessors, (306), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:33:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 332 transitions. [2025-03-17 10:33:49,797 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 332 transitions. Word has length 8 [2025-03-17 10:33:49,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:33:49,797 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 332 transitions. [2025-03-17 10:33:49,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:33:49,798 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 332 transitions. [2025-03-17 10:33:49,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 10:33:49,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:33:49,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:33:49,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:33:49,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:33:49,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:33:49,801 INFO L85 PathProgramCache]: Analyzing trace with hash -645052995, now seen corresponding path program 1 times [2025-03-17 10:33:49,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:33:49,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406288430] [2025-03-17 10:33:49,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:33:49,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:33:49,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 10:33:49,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 10:33:49,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:33:49,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:33:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:33:50,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:33:50,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406288430] [2025-03-17 10:33:50,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406288430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:33:50,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:33:50,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:33:50,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968490141] [2025-03-17 10:33:50,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:33:50,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:33:50,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:33:50,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:33:50,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:33:50,142 INFO L87 Difference]: Start difference. First operand 225 states and 332 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:33:50,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:33:50,260 INFO L93 Difference]: Finished difference Result 451 states and 665 transitions. [2025-03-17 10:33:50,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:33:50,263 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-17 10:33:50,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:33:50,264 INFO L225 Difference]: With dead ends: 451 [2025-03-17 10:33:50,265 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 10:33:50,265 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-03-17 10:33:50,266 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 106 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:33:50,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 762 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:33:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 10:33:50,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2025-03-17 10:33:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 209 states have (on average 1.430622009569378) internal successors, (299), 219 states have internal predecessors, (299), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:33:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 325 transitions. [2025-03-17 10:33:50,285 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 325 transitions. Word has length 81 [2025-03-17 10:33:50,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:33:50,285 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 325 transitions. [2025-03-17 10:33:50,285 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:33:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 325 transitions. [2025-03-17 10:33:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 10:33:50,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:33:50,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:33:50,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:33:50,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:33:50,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:33:50,290 INFO L85 PathProgramCache]: Analyzing trace with hash -932819882, now seen corresponding path program 1 times [2025-03-17 10:33:50,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:33:50,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628576018] [2025-03-17 10:33:50,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:33:50,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:33:50,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 10:33:50,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 10:33:50,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:33:50,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:33:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:33:50,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:33:50,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628576018] [2025-03-17 10:33:50,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628576018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:33:50,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:33:50,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:33:50,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871820301] [2025-03-17 10:33:50,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:33:50,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:33:50,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:33:50,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:33:50,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:33:50,470 INFO L87 Difference]: Start difference. First operand 225 states and 325 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:33:50,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:33:50,551 INFO L93 Difference]: Finished difference Result 400 states and 573 transitions. [2025-03-17 10:33:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:33:50,551 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-17 10:33:50,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:33:50,552 INFO L225 Difference]: With dead ends: 400 [2025-03-17 10:33:50,552 INFO L226 Difference]: Without dead ends: 177 [2025-03-17 10:33:50,553 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-03-17 10:33:50,553 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 9 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:33:50,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 629 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:33:50,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-17 10:33:50,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-03-17 10:33:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 161 states have (on average 1.360248447204969) internal successors, (219), 171 states have internal predecessors, (219), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:33:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 245 transitions. [2025-03-17 10:33:50,566 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 245 transitions. Word has length 81 [2025-03-17 10:33:50,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:33:50,569 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 245 transitions. [2025-03-17 10:33:50,569 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:33:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 245 transitions. [2025-03-17 10:33:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 10:33:50,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:33:50,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:33:50,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:33:50,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:33:50,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:33:50,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1033731849, now seen corresponding path program 1 times [2025-03-17 10:33:50,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:33:50,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629659576] [2025-03-17 10:33:50,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:33:50,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:33:50,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 10:33:50,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 10:33:50,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:33:50,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:33:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:33:50,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:33:50,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629659576] [2025-03-17 10:33:50,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629659576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:33:50,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:33:50,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:33:50,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279511828] [2025-03-17 10:33:50,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:33:50,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:33:50,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:33:50,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:33:50,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:33:50,745 INFO L87 Difference]: Start difference. First operand 177 states and 245 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:33:50,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:33:50,820 INFO L93 Difference]: Finished difference Result 431 states and 595 transitions. [2025-03-17 10:33:50,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:33:50,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-17 10:33:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:33:50,822 INFO L225 Difference]: With dead ends: 431 [2025-03-17 10:33:50,822 INFO L226 Difference]: Without dead ends: 256 [2025-03-17 10:33:50,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-17 10:33:50,823 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 54 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:33:50,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 452 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:33:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-17 10:33:50,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-03-17 10:33:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 240 states have (on average 1.3541666666666667) internal successors, (325), 250 states have internal predecessors, (325), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:33:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 351 transitions. [2025-03-17 10:33:50,840 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 351 transitions. Word has length 81 [2025-03-17 10:33:50,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:33:50,840 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 351 transitions. [2025-03-17 10:33:50,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:33:50,841 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 351 transitions. [2025-03-17 10:33:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 10:33:50,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:33:50,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:33:50,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:33:50,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:33:50,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:33:50,845 INFO L85 PathProgramCache]: Analyzing trace with hash 4694188, now seen corresponding path program 1 times [2025-03-17 10:33:50,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:33:50,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366319924] [2025-03-17 10:33:50,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:33:50,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:33:50,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 10:33:50,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 10:33:50,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:33:50,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:33:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:33:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:33:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366319924] [2025-03-17 10:33:51,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366319924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:33:51,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327499680] [2025-03-17 10:33:51,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:33:51,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:33:51,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:33:51,059 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-17 10:33:51,060 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-17 10:33:51,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 10:33:51,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 10:33:51,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:33:51,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:33:51,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:33:51,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:33:51,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:33:51,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:33:51,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:33:51,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327499680] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:33:51,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:33:51,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-17 10:33:51,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206900764] [2025-03-17 10:33:51,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:33:51,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:33:51,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:33:51,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:33:51,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:33:51,559 INFO L87 Difference]: Start difference. First operand 256 states and 351 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:33:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:33:51,682 INFO L93 Difference]: Finished difference Result 632 states and 865 transitions. [2025-03-17 10:33:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:33:51,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 96 [2025-03-17 10:33:51,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:33:51,686 INFO L225 Difference]: With dead ends: 632 [2025-03-17 10:33:51,686 INFO L226 Difference]: Without dead ends: 604 [2025-03-17 10:33:51,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:33:51,688 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 686 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:33:51,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 897 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:33:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-17 10:33:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2025-03-17 10:33:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 579 states have (on average 1.3316062176165804) internal successors, (771), 589 states have internal predecessors, (771), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 10:33:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 815 transitions. [2025-03-17 10:33:51,713 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 815 transitions. Word has length 96 [2025-03-17 10:33:51,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:33:51,713 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 815 transitions. [2025-03-17 10:33:51,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:33:51,714 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 815 transitions. [2025-03-17 10:33:51,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-17 10:33:51,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:33:51,721 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, 3, 3, 3, 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-17 10:33:51,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 10:33:51,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:33:51,921 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:33:51,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:33:51,923 INFO L85 PathProgramCache]: Analyzing trace with hash -492315255, now seen corresponding path program 1 times [2025-03-17 10:33:51,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:33:51,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036695317] [2025-03-17 10:33:51,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:33:51,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:33:52,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-17 10:33:52,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-17 10:33:52,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:33:52,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:33:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:33:52,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:33:52,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036695317] [2025-03-17 10:33:52,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036695317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:33:52,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937805773] [2025-03-17 10:33:52,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:33:52,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:33:52,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:33:52,644 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-17 10:33:52,645 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-17 10:33:52,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-17 10:33:53,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-17 10:33:53,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:33:53,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:33:53,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 1655 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 10:33:53,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:33:53,474 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:33:53,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:33:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:33:53,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937805773] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:33:53,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:33:53,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-17 10:33:53,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045363451] [2025-03-17 10:33:53,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:33:53,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 10:33:53,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:33:53,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 10:33:53,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:33:53,814 INFO L87 Difference]: Start difference. First operand 604 states and 815 transitions. Second operand has 12 states, 12 states have (on average 50.5) internal successors, (606), 12 states have internal predecessors, (606), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:33:54,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:33:54,096 INFO L93 Difference]: Finished difference Result 1490 states and 2014 transitions. [2025-03-17 10:33:54,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 10:33:54,097 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 50.5) internal successors, (606), 12 states have internal predecessors, (606), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 315 [2025-03-17 10:33:54,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:33:54,104 INFO L225 Difference]: With dead ends: 1490 [2025-03-17 10:33:54,105 INFO L226 Difference]: Without dead ends: 1462 [2025-03-17 10:33:54,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:33:54,106 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 2271 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2297 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:33:54,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2297 Valid, 2118 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:33:54,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2025-03-17 10:33:54,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1462. [2025-03-17 10:33:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1419 states have (on average 1.3255813953488371) internal successors, (1881), 1429 states have internal predecessors, (1881), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 31 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 10:33:54,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1961 transitions. [2025-03-17 10:33:54,156 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1961 transitions. Word has length 315 [2025-03-17 10:33:54,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:33:54,157 INFO L471 AbstractCegarLoop]: Abstraction has 1462 states and 1961 transitions. [2025-03-17 10:33:54,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 50.5) internal successors, (606), 12 states have internal predecessors, (606), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:33:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1961 transitions. [2025-03-17 10:33:54,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2025-03-17 10:33:54,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:33:54,172 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, 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, 1] [2025-03-17 10:33:54,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 10:33:54,372 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,SelfDestructingSolverStorable5 [2025-03-17 10:33:54,372 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:33:54,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:33:54,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1978997673, now seen corresponding path program 2 times [2025-03-17 10:33:54,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:33:54,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952758108] [2025-03-17 10:33:54,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:33:54,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:33:54,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 753 statements into 2 equivalence classes. [2025-03-17 10:35:00,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 753 of 753 statements. [2025-03-17 10:35:00,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:35:00,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3281 backedges. 478 proven. 3 refuted. 0 times theorem prover too weak. 2800 trivial. 0 not checked. [2025-03-17 10:35:01,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:01,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952758108] [2025-03-17 10:35:01,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952758108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:35:01,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959664457] [2025-03-17 10:35:01,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:35:01,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:35:01,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:35:01,146 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-17 10:35:01,147 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-17 10:35:01,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 753 statements into 2 equivalence classes. [2025-03-17 10:35:24,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 753 of 753 statements. [2025-03-17 10:35:24,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:35:24,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:24,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 3839 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-17 10:35:24,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:35:24,972 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-17 10:35:24,995 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 14 treesize of output 15