./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e095bb5ea0d924a9f9ab04ab393eec77de9b1aa4e50357711d33ebab16e651dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:30:51,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:30:51,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:30:51,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:30:51,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:30:51,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:30:51,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:30:51,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:30:51,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:30:51,119 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:30:51,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:30:51,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:30:51,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:30:51,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:30:51,121 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:30:51,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:30:51,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:30:51,121 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:30:51,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:30:51,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:30:51,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:30:51,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:30:51,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:30:51,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:30:51,122 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:30:51,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:30:51,122 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:30:51,122 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:30:51,122 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:30:51,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:30:51,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:30:51,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:30:51,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:30:51,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:30:51,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:30:51,123 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:30:51,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:30:51,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:30:51,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:30:51,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:30:51,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:30:51,123 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:30:51,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:30:51,124 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 -> e095bb5ea0d924a9f9ab04ab393eec77de9b1aa4e50357711d33ebab16e651dd [2025-03-17 10:30:51,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:30:51,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:30:51,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:30:51,364 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:30:51,364 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:30:51,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i [2025-03-17 10:30:52,515 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cfee56bd/438a0f32a8f14aef88efc3939a70eeea/FLAG951ad751a [2025-03-17 10:30:52,799 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:30:52,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i [2025-03-17 10:30:52,819 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cfee56bd/438a0f32a8f14aef88efc3939a70eeea/FLAG951ad751a [2025-03-17 10:30:52,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cfee56bd/438a0f32a8f14aef88efc3939a70eeea [2025-03-17 10:30:52,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:30:52,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:30:52,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:30:52,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:30:52,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:30:52,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:30:52" (1/1) ... [2025-03-17 10:30:52,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2c4a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:52, skipping insertion in model container [2025-03-17 10:30:52,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:30:52" (1/1) ... [2025-03-17 10:30:52,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:30:53,116 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_OAT_test4-2.i[33021,33034] [2025-03-17 10:30:53,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:30:53,221 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:30:53,258 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_OAT_test4-2.i[33021,33034] [2025-03-17 10:30:53,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:30:53,355 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:30:53,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53 WrapperNode [2025-03-17 10:30:53,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:30:53,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:30:53,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:30:53,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:30:53,360 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:30:53" (1/1) ... [2025-03-17 10:30:53,390 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:30:53" (1/1) ... [2025-03-17 10:30:53,449 INFO L138 Inliner]: procedures = 176, calls = 386, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1699 [2025-03-17 10:30:53,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:30:53,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:30:53,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:30:53,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:30:53,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,548 INFO L175 MemorySlicer]: Split 357 memory accesses to 2 slices as follows [2, 355]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 90 writes are split as follows [0, 90]. [2025-03-17 10:30:53,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,577 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:30:53,614 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:30:53,614 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:30:53,614 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:30:53,615 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (1/1) ... [2025-03-17 10:30:53,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:30:53,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:30:53,645 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:30:53,651 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:30:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:30:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:30:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 10:30:53,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 10:30:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:30:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:30:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:30:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:30:53,666 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:30:53,666 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:30:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:30:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:30:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:30:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:30:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:30:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:30:53,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:30:53,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:30:53,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:30:53,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:30:53,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:30:53,827 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:30:53,828 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:30:55,054 INFO L? ?]: Removed 409 outVars from TransFormulas that were not future-live. [2025-03-17 10:30:55,054 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:30:55,096 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:30:55,096 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 10:30:55,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:30:55 BoogieIcfgContainer [2025-03-17 10:30:55,097 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:30:55,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:30:55,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:30:55,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:30:55,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:30:52" (1/3) ... [2025-03-17 10:30:55,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ae440e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:30:55, skipping insertion in model container [2025-03-17 10:30:55,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:53" (2/3) ... [2025-03-17 10:30:55,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ae440e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:30:55, skipping insertion in model container [2025-03-17 10:30:55,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:30:55" (3/3) ... [2025-03-17 10:30:55,105 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-2.i [2025-03-17 10:30:55,116 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:30:55,117 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test4-2.i that has 4 procedures, 450 locations, 1 initial locations, 39 loop locations, and 1 error locations. [2025-03-17 10:30:55,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:30:55,177 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;@1dc379b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:30:55,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 10:30:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 446 states, 426 states have (on average 1.6220657276995305) internal successors, (691), 437 states have internal predecessors, (691), 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:30:55,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 10:30:55,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:55,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:30:55,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:55,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:55,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1881719175, now seen corresponding path program 1 times [2025-03-17 10:30:55,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:55,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385776143] [2025-03-17 10:30:55,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:55,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:55,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 10:30:55,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 10:30:55,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:55,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:55,317 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:30:55,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:55,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385776143] [2025-03-17 10:30:55,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385776143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:55,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:55,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:30:55,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425676095] [2025-03-17 10:30:55,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:55,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:30:55,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:55,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:30:55,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:55,339 INFO L87 Difference]: Start difference. First operand has 446 states, 426 states have (on average 1.6220657276995305) internal successors, (691), 437 states have internal predecessors, (691), 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:30:55,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:55,550 INFO L93 Difference]: Finished difference Result 1269 states and 2069 transitions. [2025-03-17 10:30:55,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:30:55,552 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:30:55,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:55,568 INFO L225 Difference]: With dead ends: 1269 [2025-03-17 10:30:55,568 INFO L226 Difference]: Without dead ends: 789 [2025-03-17 10:30:55,572 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:30:55,574 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 539 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:55,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1211 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:30:55,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-17 10:30:55,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 412. [2025-03-17 10:30:55,621 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:30:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 606 transitions. [2025-03-17 10:30:55,626 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 606 transitions. Word has length 8 [2025-03-17 10:30:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:55,626 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 606 transitions. [2025-03-17 10:30:55,627 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:30:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 606 transitions. [2025-03-17 10:30:55,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:30:55,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:55,634 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:30:55,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:30:55,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:55,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:55,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1904898945, now seen corresponding path program 1 times [2025-03-17 10:30:55,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:55,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934492395] [2025-03-17 10:30:55,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:55,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:55,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:30:55,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:30:55,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:55,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:56,152 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:30:56,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:56,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934492395] [2025-03-17 10:30:56,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934492395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:56,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:56,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:30:56,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658857192] [2025-03-17 10:30:56,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:56,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:30:56,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:56,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:30:56,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:30:56,155 INFO L87 Difference]: Start difference. First operand 412 states and 606 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:30:56,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:56,338 INFO L93 Difference]: Finished difference Result 825 states and 1213 transitions. [2025-03-17 10:30:56,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:30:56,339 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:30:56,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:56,341 INFO L225 Difference]: With dead ends: 825 [2025-03-17 10:30:56,341 INFO L226 Difference]: Without dead ends: 415 [2025-03-17 10:30:56,342 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:30:56,343 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:56,343 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.2s Time] [2025-03-17 10:30:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-17 10:30:56,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 412. [2025-03-17 10:30:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 393 states have (on average 1.4427480916030535) internal successors, (567), 403 states have internal predecessors, (567), 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:30:56,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 599 transitions. [2025-03-17 10:30:56,361 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 599 transitions. Word has length 150 [2025-03-17 10:30:56,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:56,362 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 599 transitions. [2025-03-17 10:30:56,362 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:30:56,362 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 599 transitions. [2025-03-17 10:30:56,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:30:56,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:56,364 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:30:56,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:30:56,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:56,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:56,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2019949178, now seen corresponding path program 1 times [2025-03-17 10:30:56,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:56,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624771147] [2025-03-17 10:30:56,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:56,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:56,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:30:56,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:30:56,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:56,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:56,609 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:30:56,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:56,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624771147] [2025-03-17 10:30:56,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624771147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:56,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:56,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:30:56,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628661178] [2025-03-17 10:30:56,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:56,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:30:56,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:56,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:30:56,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:56,611 INFO L87 Difference]: Start difference. First operand 412 states and 599 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:30:56,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:56,729 INFO L93 Difference]: Finished difference Result 949 states and 1383 transitions. [2025-03-17 10:30:56,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:30:56,730 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:30:56,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:56,732 INFO L225 Difference]: With dead ends: 949 [2025-03-17 10:30:56,732 INFO L226 Difference]: Without dead ends: 539 [2025-03-17 10:30:56,733 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:30:56,733 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:30:56,734 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:30:56,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-17 10:30:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-03-17 10:30:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 520 states have (on average 1.448076923076923) internal successors, (753), 530 states have internal predecessors, (753), 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:30:56,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 785 transitions. [2025-03-17 10:30:56,746 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 785 transitions. Word has length 150 [2025-03-17 10:30:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:56,746 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 785 transitions. [2025-03-17 10:30:56,746 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:30:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 785 transitions. [2025-03-17 10:30:56,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 10:30:56,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:56,748 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:30:56,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:30:56,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:56,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:56,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1294788810, now seen corresponding path program 1 times [2025-03-17 10:30:56,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:56,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112663778] [2025-03-17 10:30:56,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:56,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:56,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 10:30:56,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 10:30:56,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:56,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:57,053 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:30:57,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:57,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112663778] [2025-03-17 10:30:57,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112663778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:57,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:57,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:30:57,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867574406] [2025-03-17 10:30:57,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:57,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:30:57,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:57,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:30:57,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:30:57,057 INFO L87 Difference]: Start difference. First operand 539 states and 785 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:30:57,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:57,188 INFO L93 Difference]: Finished difference Result 907 states and 1316 transitions. [2025-03-17 10:30:57,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:30:57,189 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:30:57,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:57,193 INFO L225 Difference]: With dead ends: 907 [2025-03-17 10:30:57,195 INFO L226 Difference]: Without dead ends: 497 [2025-03-17 10:30:57,195 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:30:57,196 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 36 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:57,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1363 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:30:57,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-17 10:30:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2025-03-17 10:30:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 478 states have (on average 1.4142259414225942) internal successors, (676), 488 states have internal predecessors, (676), 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:30:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 708 transitions. [2025-03-17 10:30:57,208 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 708 transitions. Word has length 165 [2025-03-17 10:30:57,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:57,208 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 708 transitions. [2025-03-17 10:30:57,208 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:30:57,208 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 708 transitions. [2025-03-17 10:30:57,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 10:30:57,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:57,210 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:30:57,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:30:57,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:57,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:57,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1240139372, now seen corresponding path program 1 times [2025-03-17 10:30:57,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:57,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445709624] [2025-03-17 10:30:57,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:57,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:57,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 10:30:57,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 10:30:57,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:57,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:57,444 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:30:57,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:57,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445709624] [2025-03-17 10:30:57,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445709624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:57,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:57,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:30:57,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761608812] [2025-03-17 10:30:57,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:57,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:30:57,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:57,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:30:57,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:30:57,447 INFO L87 Difference]: Start difference. First operand 497 states and 708 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:30:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:57,572 INFO L93 Difference]: Finished difference Result 859 states and 1222 transitions. [2025-03-17 10:30:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:30:57,572 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:30:57,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:57,575 INFO L225 Difference]: With dead ends: 859 [2025-03-17 10:30:57,575 INFO L226 Difference]: Without dead ends: 491 [2025-03-17 10:30:57,578 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:30:57,581 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 9 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:57,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1364 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:30:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-17 10:30:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2025-03-17 10:30:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 472 states have (on average 1.4110169491525424) internal successors, (666), 482 states have internal predecessors, (666), 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:30:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 698 transitions. [2025-03-17 10:30:57,594 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 698 transitions. Word has length 165 [2025-03-17 10:30:57,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:57,595 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 698 transitions. [2025-03-17 10:30:57,595 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:30:57,595 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 698 transitions. [2025-03-17 10:30:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 10:30:57,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:57,597 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:30:57,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:30:57,597 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:57,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:57,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1683467664, now seen corresponding path program 1 times [2025-03-17 10:30:57,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:57,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468866991] [2025-03-17 10:30:57,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:57,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:57,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 10:30:57,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 10:30:57,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:57,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:57,810 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:30:57,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:57,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468866991] [2025-03-17 10:30:57,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468866991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:57,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:57,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:30:57,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457555073] [2025-03-17 10:30:57,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:57,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:30:57,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:57,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:30:57,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:57,812 INFO L87 Difference]: Start difference. First operand 491 states and 698 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:30:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:57,930 INFO L93 Difference]: Finished difference Result 990 states and 1393 transitions. [2025-03-17 10:30:57,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:30:57,931 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:30:57,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:57,933 INFO L225 Difference]: With dead ends: 990 [2025-03-17 10:30:57,933 INFO L226 Difference]: Without dead ends: 628 [2025-03-17 10:30:57,934 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:30:57,937 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 238 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 942 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:30:57,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 942 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:30:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-03-17 10:30:57,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2025-03-17 10:30:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 606 states have (on average 1.3927392739273927) internal successors, (844), 616 states have internal predecessors, (844), 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:30:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 882 transitions. [2025-03-17 10:30:57,960 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 882 transitions. Word has length 165 [2025-03-17 10:30:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:57,960 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 882 transitions. [2025-03-17 10:30:57,960 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:30:57,961 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 882 transitions. [2025-03-17 10:30:57,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-17 10:30:57,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:57,963 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:30:57,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:30:57,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:57,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:57,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2135730515, now seen corresponding path program 1 times [2025-03-17 10:30:57,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:57,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052756054] [2025-03-17 10:30:57,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:57,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:58,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 10:30:58,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 10:30:58,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:58,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:58,242 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:30:58,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:58,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052756054] [2025-03-17 10:30:58,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052756054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:30:58,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549666485] [2025-03-17 10:30:58,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:58,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:30:58,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:30:58,245 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:30:58,247 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:30:58,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 10:30:58,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 10:30:58,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:58,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:58,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:30:58,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:30:58,861 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:30:58,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:30:59,078 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:30:59,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549666485] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:30:59,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:30:59,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 10:30:59,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296342015] [2025-03-17 10:30:59,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:30:59,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:30:59,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:59,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:30:59,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:30:59,080 INFO L87 Difference]: Start difference. First operand 628 states and 882 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:30:59,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:59,346 INFO L93 Difference]: Finished difference Result 1378 states and 1930 transitions. [2025-03-17 10:30:59,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:30:59,347 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:30:59,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:59,352 INFO L225 Difference]: With dead ends: 1378 [2025-03-17 10:30:59,353 INFO L226 Difference]: Without dead ends: 1350 [2025-03-17 10:30:59,353 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:30:59,354 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 3013 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3029 SdHoareTripleChecker+Valid, 2201 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:59,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3029 Valid, 2201 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:30:59,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-03-17 10:30:59,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1350. [2025-03-17 10:30:59,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1313 states have (on average 1.38004569687738) internal successors, (1812), 1323 states have internal predecessors, (1812), 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:30:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1880 transitions. [2025-03-17 10:30:59,386 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1880 transitions. Word has length 180 [2025-03-17 10:30:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:59,386 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1880 transitions. [2025-03-17 10:30:59,387 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:30:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1880 transitions. [2025-03-17 10:30:59,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-03-17 10:30:59,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:59,397 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:30:59,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 10:30:59,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:30:59,598 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:59,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2128324328, now seen corresponding path program 1 times [2025-03-17 10:30:59,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:59,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367489114] [2025-03-17 10:30:59,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:59,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:59,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-17 10:31:00,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-17 10:31:00,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:31:00,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:31:01,080 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:31:01,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:31:01,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367489114] [2025-03-17 10:31:01,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367489114] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:31:01,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651257443] [2025-03-17 10:31:01,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:31:01,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:31:01,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:31:01,083 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:31:01,085 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:31:01,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-17 10:31:01,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-17 10:31:01,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:31:01,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:31:01,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 3104 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 10:31:01,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:31:02,488 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:31:02,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:31:03,097 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:31:03,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651257443] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:31:03,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:31:03,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 10:31:03,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647416991] [2025-03-17 10:31:03,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:31:03,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 10:31:03,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:31:03,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 10:31:03,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:31:03,102 INFO L87 Difference]: Start difference. First operand 1350 states and 1880 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:31:03,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:31:03,715 INFO L93 Difference]: Finished difference Result 3358 states and 4681 transitions. [2025-03-17 10:31:03,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 10:31:03,716 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:31:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:31:03,728 INFO L225 Difference]: With dead ends: 3358 [2025-03-17 10:31:03,729 INFO L226 Difference]: Without dead ends: 3330 [2025-03-17 10:31:03,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1217 GetRequests, 1206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:31:03,731 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 6216 mSDsluCounter, 3980 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6268 SdHoareTripleChecker+Valid, 4492 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:31:03,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6268 Valid, 4492 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:31:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2025-03-17 10:31:03,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 3330. [2025-03-17 10:31:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3330 states, 3257 states have (on average 1.3779551734725208) internal successors, (4488), 3267 states have internal predecessors, (4488), 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:31:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 4628 transitions. [2025-03-17 10:31:03,808 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 4628 transitions. Word has length 606 [2025-03-17 10:31:03,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:31:03,809 INFO L471 AbstractCegarLoop]: Abstraction has 3330 states and 4628 transitions. [2025-03-17 10:31:03,810 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:31:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 4628 transitions. [2025-03-17 10:31:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1459 [2025-03-17 10:31:03,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:31:03,870 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:31:03,885 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:31:04,071 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,SelfDestructingSolverStorable7 [2025-03-17 10:31:04,074 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:31:04,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:31:04,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1760476334, now seen corresponding path program 2 times [2025-03-17 10:31:04,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:31:04,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342785030] [2025-03-17 10:31:04,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:31:04,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:31:04,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1458 statements into 2 equivalence classes.