./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.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_test4-1.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 8d4416b38cd75f122474354d64a020f92e3751959548582c6308a6e879679f77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:34:24,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:34:24,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:34:24,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:34:24,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:34:24,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:34:24,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:34:24,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:34:24,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:34:24,298 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:34:24,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:34:24,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:34:24,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:34:24,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:34:24,299 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:34:24,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:34:24,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:34:24,299 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:34:24,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:34:24,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:34:24,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:34:24,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:34:24,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:34:24,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:34:24,300 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:34:24,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:34:24,300 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:34:24,300 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:34:24,300 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:34:24,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:34:24,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:34:24,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:34:24,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:34:24,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:34:24,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:34:24,301 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:34:24,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:34:24,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:34:24,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:34:24,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:34:24,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:34:24,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:34:24,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:34:24,302 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 -> 8d4416b38cd75f122474354d64a020f92e3751959548582c6308a6e879679f77 [2025-03-17 10:34:24,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:34:24,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:34:24,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:34:24,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:34:24,552 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:34:24,554 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_test4-1.i [2025-03-17 10:34:25,732 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba853724e/8cc6ebd00d63424aa1299aa39b2f73c8/FLAG365bb3f13 [2025-03-17 10:34:26,107 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:34:26,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i [2025-03-17 10:34:26,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba853724e/8cc6ebd00d63424aa1299aa39b2f73c8/FLAG365bb3f13 [2025-03-17 10:34:26,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba853724e/8cc6ebd00d63424aa1299aa39b2f73c8 [2025-03-17 10:34:26,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:34:26,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:34:26,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:34:26,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:34:26,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:34:26,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:34:26" (1/1) ... [2025-03-17 10:34:26,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263da4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:26, skipping insertion in model container [2025-03-17 10:34:26,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:34:26" (1/1) ... [2025-03-17 10:34:26,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:34:26,636 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_test4-1.i[33021,33034] [2025-03-17 10:34:26,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:34:26,751 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:34:26,789 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_test4-1.i[33021,33034] [2025-03-17 10:34:26,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:34:26,867 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:34:26,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:26 WrapperNode [2025-03-17 10:34:26,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:34:26,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:34:26,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:34:26,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:34:26,874 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:34:26" (1/1) ... [2025-03-17 10:34:26,892 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:34:26" (1/1) ... [2025-03-17 10:34:26,942 INFO L138 Inliner]: procedures = 176, calls = 335, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1540 [2025-03-17 10:34:26,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:34:26,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:34:26,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:34:26,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:34:26,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:26" (1/1) ... [2025-03-17 10:34:26,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:26" (1/1) ... [2025-03-17 10:34:26,958 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:26" (1/1) ... [2025-03-17 10:34:27,017 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2025-03-17 10:34:27,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:26" (1/1) ... [2025-03-17 10:34:27,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:26" (1/1) ... [2025-03-17 10:34:27,060 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:26" (1/1) ... [2025-03-17 10:34:27,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:26" (1/1) ... [2025-03-17 10:34:27,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:26" (1/1) ... [2025-03-17 10:34:27,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:26" (1/1) ... [2025-03-17 10:34:27,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:34:27,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:34:27,084 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:34:27,084 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:34:27,085 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:26" (1/1) ... [2025-03-17 10:34:27,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:34:27,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:34:27,111 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:34:27,114 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:34:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:34:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:34:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 10:34:27,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 10:34:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:34:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:34:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:34:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:34:27,132 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:34:27,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:34:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:34:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:34:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:34:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:34:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:34:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:34:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:34:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:34:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:34:27,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:34:27,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:34:27,296 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:34:27,297 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:34:28,568 INFO L? ?]: Removed 385 outVars from TransFormulas that were not future-live. [2025-03-17 10:34:28,568 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:34:28,610 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:34:28,610 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 10:34:28,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:34:28 BoogieIcfgContainer [2025-03-17 10:34:28,611 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:34:28,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:34:28,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:34:28,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:34:28,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:34:26" (1/3) ... [2025-03-17 10:34:28,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc71ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:34:28, skipping insertion in model container [2025-03-17 10:34:28,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:26" (2/3) ... [2025-03-17 10:34:28,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc71ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:34:28, skipping insertion in model container [2025-03-17 10:34:28,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:34:28" (3/3) ... [2025-03-17 10:34:28,617 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test4-1.i [2025-03-17 10:34:28,631 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:34:28,632 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test4-1.i that has 4 procedures, 417 locations, 1 initial locations, 34 loop locations, and 1 error locations. [2025-03-17 10:34:28,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:34:28,691 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;@60fcf799, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:34:28,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 10:34:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand has 413 states, 393 states have (on average 1.6208651399491094) internal successors, (637), 404 states have internal predecessors, (637), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:34:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 10:34:28,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:28,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:28,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:28,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:28,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2147192071, now seen corresponding path program 1 times [2025-03-17 10:34:28,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:28,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298555553] [2025-03-17 10:34:28,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:28,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:28,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 10:34:28,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 10:34:28,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:28,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:28,875 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:34:28,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:28,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298555553] [2025-03-17 10:34:28,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298555553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:28,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:28,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:34:28,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392805955] [2025-03-17 10:34:28,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:28,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:34:28,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:28,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:34:28,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:34:28,903 INFO L87 Difference]: Start difference. First operand has 413 states, 393 states have (on average 1.6208651399491094) internal successors, (637), 404 states have internal predecessors, (637), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) 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:34:29,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:29,120 INFO L93 Difference]: Finished difference Result 1203 states and 1961 transitions. [2025-03-17 10:34:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:34:29,122 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:34:29,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:29,134 INFO L225 Difference]: With dead ends: 1203 [2025-03-17 10:34:29,137 INFO L226 Difference]: Without dead ends: 789 [2025-03-17 10:34:29,140 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:34:29,142 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 539 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:29,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1156 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:29,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-17 10:34:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 412. [2025-03-17 10:34:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 393 states have (on average 1.460559796437659) internal successors, (574), 403 states have internal predecessors, (574), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:34:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 606 transitions. [2025-03-17 10:34:29,196 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 606 transitions. Word has length 8 [2025-03-17 10:34:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:29,197 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 606 transitions. [2025-03-17 10:34:29,197 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:34:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 606 transitions. [2025-03-17 10:34:29,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:34:29,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:29,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:29,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:34:29,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:29,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:29,205 INFO L85 PathProgramCache]: Analyzing trace with hash -108512608, now seen corresponding path program 1 times [2025-03-17 10:34:29,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:29,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943323378] [2025-03-17 10:34:29,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:29,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:29,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:34:29,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:34:29,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:29,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:29,664 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:34:29,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:29,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943323378] [2025-03-17 10:34:29,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943323378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:29,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:29,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:34:29,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959989380] [2025-03-17 10:34:29,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:29,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:34:29,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:29,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:34:29,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:34:29,666 INFO L87 Difference]: Start difference. First operand 412 states and 606 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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:34:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:29,836 INFO L93 Difference]: Finished difference Result 842 states and 1240 transitions. [2025-03-17 10:34:29,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:34:29,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 150 [2025-03-17 10:34:29,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:29,840 INFO L225 Difference]: With dead ends: 842 [2025-03-17 10:34:29,840 INFO L226 Difference]: Without dead ends: 432 [2025-03-17 10:34:29,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:34:29,843 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 9 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:29,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1067 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:29,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-03-17 10:34:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2025-03-17 10:34:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 413 states have (on average 1.4382566585956416) internal successors, (594), 423 states have internal predecessors, (594), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:34:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 626 transitions. [2025-03-17 10:34:29,864 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 626 transitions. Word has length 150 [2025-03-17 10:34:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:29,864 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 626 transitions. [2025-03-17 10:34:29,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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:34:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 626 transitions. [2025-03-17 10:34:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:34:29,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:29,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:29,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:34:29,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:29,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash -30522337, now seen corresponding path program 1 times [2025-03-17 10:34:29,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:29,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298700507] [2025-03-17 10:34:29,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:29,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:29,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:34:29,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:34:29,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:29,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:30,237 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:34:30,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:30,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298700507] [2025-03-17 10:34:30,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298700507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:30,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:30,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:34:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108274156] [2025-03-17 10:34:30,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:30,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:34:30,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:30,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:34:30,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:34:30,240 INFO L87 Difference]: Start difference. First operand 432 states and 626 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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:34:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:30,388 INFO L93 Difference]: Finished difference Result 848 states and 1236 transitions. [2025-03-17 10:34:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:34:30,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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 150 [2025-03-17 10:34:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:30,391 INFO L225 Difference]: With dead ends: 848 [2025-03-17 10:34:30,391 INFO L226 Difference]: Without dead ends: 418 [2025-03-17 10:34:30,392 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:34:30,392 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 105 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:30,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1518 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-17 10:34:30,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-03-17 10:34:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 399 states have (on average 1.4360902255639099) internal successors, (573), 409 states have internal predecessors, (573), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:34:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 605 transitions. [2025-03-17 10:34:30,407 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 605 transitions. Word has length 150 [2025-03-17 10:34:30,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:30,407 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 605 transitions. [2025-03-17 10:34:30,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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:34:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 605 transitions. [2025-03-17 10:34:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:34:30,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:30,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:30,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:34:30,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:30,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:30,410 INFO L85 PathProgramCache]: Analyzing trace with hash -145572570, now seen corresponding path program 1 times [2025-03-17 10:34:30,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:30,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256068258] [2025-03-17 10:34:30,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:30,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:30,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:34:30,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:34:30,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:30,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:30,639 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:34:30,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:30,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256068258] [2025-03-17 10:34:30,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256068258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:30,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:30,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:34:30,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862231547] [2025-03-17 10:34:30,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:30,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:34:30,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:30,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:34:30,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:34:30,641 INFO L87 Difference]: Start difference. First operand 418 states and 605 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 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:34:30,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:30,757 INFO L93 Difference]: Finished difference Result 967 states and 1401 transitions. [2025-03-17 10:34:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:34:30,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 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 150 [2025-03-17 10:34:30,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:30,760 INFO L225 Difference]: With dead ends: 967 [2025-03-17 10:34:30,760 INFO L226 Difference]: Without dead ends: 551 [2025-03-17 10:34:30,761 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:34:30,762 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 134 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:30,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1099 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-17 10:34:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-17 10:34:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 532 states have (on average 1.4379699248120301) internal successors, (765), 542 states have internal predecessors, (765), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:34:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 797 transitions. [2025-03-17 10:34:30,774 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 797 transitions. Word has length 150 [2025-03-17 10:34:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:30,775 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 797 transitions. [2025-03-17 10:34:30,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 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:34:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 797 transitions. [2025-03-17 10:34:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 10:34:30,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:30,777 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:30,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:34:30,777 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:30,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:30,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1623500319, now seen corresponding path program 1 times [2025-03-17 10:34:30,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:30,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823396109] [2025-03-17 10:34:30,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:30,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:30,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 10:34:30,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 10:34:30,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:30,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:31,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:31,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823396109] [2025-03-17 10:34:31,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823396109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:31,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:31,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:34:31,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311880812] [2025-03-17 10:34:31,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:31,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:34:31,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:31,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:34:31,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:34:31,079 INFO L87 Difference]: Start difference. First operand 551 states and 797 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:31,225 INFO L93 Difference]: Finished difference Result 925 states and 1334 transitions. [2025-03-17 10:34:31,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:34:31,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 165 [2025-03-17 10:34:31,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:31,230 INFO L225 Difference]: With dead ends: 925 [2025-03-17 10:34:31,230 INFO L226 Difference]: Without dead ends: 509 [2025-03-17 10:34:31,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:34:31,232 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 30 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:31,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1367 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:31,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-17 10:34:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-03-17 10:34:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 490 states have (on average 1.4040816326530612) internal successors, (688), 500 states have internal predecessors, (688), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:34:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 720 transitions. [2025-03-17 10:34:31,273 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 720 transitions. Word has length 165 [2025-03-17 10:34:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:31,274 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 720 transitions. [2025-03-17 10:34:31,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 720 transitions. [2025-03-17 10:34:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 10:34:31,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:31,277 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:31,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:34:31,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:31,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1335733432, now seen corresponding path program 1 times [2025-03-17 10:34:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:31,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584092292] [2025-03-17 10:34:31,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:31,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:31,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 10:34:31,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 10:34:31,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:31,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:31,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:31,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584092292] [2025-03-17 10:34:31,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584092292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:31,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:31,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:34:31,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507484474] [2025-03-17 10:34:31,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:31,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:34:31,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:31,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:34:31,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:34:31,513 INFO L87 Difference]: Start difference. First operand 509 states and 720 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:31,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:31,601 INFO L93 Difference]: Finished difference Result 883 states and 1246 transitions. [2025-03-17 10:34:31,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:34:31,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 165 [2025-03-17 10:34:31,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:31,604 INFO L225 Difference]: With dead ends: 883 [2025-03-17 10:34:31,604 INFO L226 Difference]: Without dead ends: 509 [2025-03-17 10:34:31,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:34:31,608 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 1 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:31,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 926 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-17 10:34:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-03-17 10:34:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 490 states have (on average 1.3979591836734695) internal successors, (685), 500 states have internal predecessors, (685), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:34:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 717 transitions. [2025-03-17 10:34:31,625 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 717 transitions. Word has length 165 [2025-03-17 10:34:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:31,626 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 717 transitions. [2025-03-17 10:34:31,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 717 transitions. [2025-03-17 10:34:31,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 10:34:31,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:31,627 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:31,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:34:31,627 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:31,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash 897723929, now seen corresponding path program 1 times [2025-03-17 10:34:31,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:31,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969969936] [2025-03-17 10:34:31,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:31,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:31,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 10:34:31,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 10:34:31,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:31,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:31,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:31,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969969936] [2025-03-17 10:34:31,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969969936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:31,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:31,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:34:31,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117073645] [2025-03-17 10:34:31,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:31,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:34:31,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:31,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:34:31,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:34:31,882 INFO L87 Difference]: Start difference. First operand 509 states and 717 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:32,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:32,002 INFO L93 Difference]: Finished difference Result 1026 states and 1432 transitions. [2025-03-17 10:34:32,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:34:32,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 165 [2025-03-17 10:34:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:32,006 INFO L225 Difference]: With dead ends: 1026 [2025-03-17 10:34:32,006 INFO L226 Difference]: Without dead ends: 652 [2025-03-17 10:34:32,006 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-03-17 10:34:32,008 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 242 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:32,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 950 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-03-17 10:34:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2025-03-17 10:34:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 630 states have (on average 1.380952380952381) internal successors, (870), 640 states have internal predecessors, (870), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 10:34:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 908 transitions. [2025-03-17 10:34:32,028 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 908 transitions. Word has length 165 [2025-03-17 10:34:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:32,028 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 908 transitions. [2025-03-17 10:34:32,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 908 transitions. [2025-03-17 10:34:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-17 10:34:32,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:32,030 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:32,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:34:32,030 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:32,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:32,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1554100653, now seen corresponding path program 1 times [2025-03-17 10:34:32,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:32,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692703410] [2025-03-17 10:34:32,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:32,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:32,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 10:34:32,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 10:34:32,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:32,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:34:32,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:32,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692703410] [2025-03-17 10:34:32,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692703410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:34:32,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766213239] [2025-03-17 10:34:32,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:32,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:34:32,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:34:32,305 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:34:32,306 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:34:32,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 10:34:32,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 10:34:32,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:32,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:32,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:34:32,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:34:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:34:32,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:34:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:34:33,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766213239] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:34:33,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:34:33,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 10:34:33,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780682832] [2025-03-17 10:34:33,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:34:33,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:34:33,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:33,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:34:33,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:34:33,184 INFO L87 Difference]: Start difference. First operand 652 states and 908 transitions. Second operand has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:34:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:33,486 INFO L93 Difference]: Finished difference Result 1426 states and 1982 transitions. [2025-03-17 10:34:33,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:34:33,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 180 [2025-03-17 10:34:33,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:33,492 INFO L225 Difference]: With dead ends: 1426 [2025-03-17 10:34:33,492 INFO L226 Difference]: Without dead ends: 1398 [2025-03-17 10:34:33,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 357 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-03-17 10:34:33,494 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 2218 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2234 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:33,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2234 Valid, 2409 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:34:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-17 10:34:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1398. [2025-03-17 10:34:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1361 states have (on average 1.3695811903012491) internal successors, (1864), 1371 states have internal predecessors, (1864), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 10:34:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1932 transitions. [2025-03-17 10:34:33,528 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1932 transitions. Word has length 180 [2025-03-17 10:34:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:33,529 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 1932 transitions. [2025-03-17 10:34:33,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:34:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1932 transitions. [2025-03-17 10:34:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-03-17 10:34:33,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:33,538 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:33,548 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:34:33,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:34:33,742 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:33,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:33,743 INFO L85 PathProgramCache]: Analyzing trace with hash 194265992, now seen corresponding path program 1 times [2025-03-17 10:34:33,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:33,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637346905] [2025-03-17 10:34:33,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:33,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:33,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-17 10:34:34,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-17 10:34:34,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:34,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 844 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:34:35,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:35,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637346905] [2025-03-17 10:34:35,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637346905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:34:35,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695549362] [2025-03-17 10:34:35,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:35,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:34:35,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:34:35,088 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:34:35,090 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:34:35,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-17 10:34:35,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-17 10:34:35,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:35,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:35,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 3104 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 10:34:35,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:34:36,524 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 844 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:34:36,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:34:37,126 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 844 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:34:37,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695549362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:34:37,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:34:37,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 10:34:37,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982987287] [2025-03-17 10:34:37,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:34:37,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 10:34:37,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:37,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 10:34:37,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:34:37,130 INFO L87 Difference]: Start difference. First operand 1398 states and 1932 transitions. Second operand has 13 states, 13 states have (on average 101.61538461538461) internal successors, (1321), 13 states have internal predecessors, (1321), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:34:37,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:37,817 INFO L93 Difference]: Finished difference Result 3478 states and 4811 transitions. [2025-03-17 10:34:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 10:34:37,818 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 101.61538461538461) internal successors, (1321), 13 states have internal predecessors, (1321), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 606 [2025-03-17 10:34:37,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:37,831 INFO L225 Difference]: With dead ends: 3478 [2025-03-17 10:34:37,831 INFO L226 Difference]: Without dead ends: 3450 [2025-03-17 10:34:37,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1217 GetRequests, 1206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:34:37,833 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 5895 mSDsluCounter, 4130 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5947 SdHoareTripleChecker+Valid, 4802 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:37,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5947 Valid, 4802 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:34:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2025-03-17 10:34:37,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 3450. [2025-03-17 10:34:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 3377 states have (on average 1.3674859342611785) internal successors, (4618), 3387 states have internal predecessors, (4618), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 61 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 10:34:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4758 transitions. [2025-03-17 10:34:37,916 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4758 transitions. Word has length 606 [2025-03-17 10:34:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:37,918 INFO L471 AbstractCegarLoop]: Abstraction has 3450 states and 4758 transitions. [2025-03-17 10:34:37,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 101.61538461538461) internal successors, (1321), 13 states have internal predecessors, (1321), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:34:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4758 transitions. [2025-03-17 10:34:37,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1459 [2025-03-17 10:34:37,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:37,952 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:37,965 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:34:38,152 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,SelfDestructingSolverStorable8 [2025-03-17 10:34:38,153 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:38,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:38,154 INFO L85 PathProgramCache]: Analyzing trace with hash 39401266, now seen corresponding path program 2 times [2025-03-17 10:34:38,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:38,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009946051] [2025-03-17 10:34:38,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:34:38,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:38,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1458 statements into 2 equivalence classes.