./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:34:06,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:34:06,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:34:06,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:34:06,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:34:06,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:34:06,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:34:06,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:34:06,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:34:06,839 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:34:06,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:34:06,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:34:06,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:34:06,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:34:06,840 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:34:06,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:34:06,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:34:06,841 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:34:06,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:34:06,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:34:06,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:34:06,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:34:06,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:34:06,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:34:06,841 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:34:06,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:34:06,842 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:34:06,842 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:34:06,842 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:34:06,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:34:06,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:34:06,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:34:06,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:34:06,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:34:06,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:34:06,843 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:34:06,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:34:06,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:34:06,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:34:06,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:34:06,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:34:06,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:34:06,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:34:06,843 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 -> dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c [2025-03-17 10:34:07,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:34:07,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:34:07,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:34:07,074 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:34:07,074 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:34:07,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2025-03-17 10:34:08,237 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33eccbd43/f4b38ff7f5de492593d9ac143727c19b/FLAGd9193ab61 [2025-03-17 10:34:08,574 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:34:08,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2025-03-17 10:34:08,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33eccbd43/f4b38ff7f5de492593d9ac143727c19b/FLAGd9193ab61 [2025-03-17 10:34:08,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33eccbd43/f4b38ff7f5de492593d9ac143727c19b [2025-03-17 10:34:08,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:34:08,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:34:08,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:34:08,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:34:08,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:34:08,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:34:08" (1/1) ... [2025-03-17 10:34:08,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5a6f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:08, skipping insertion in model container [2025-03-17 10:34:08,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:34:08" (1/1) ... [2025-03-17 10:34:08,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:34:09,062 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i[37019,37032] [2025-03-17 10:34:09,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i[47352,47365] [2025-03-17 10:34:09,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:34:09,165 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:34:09,198 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i[37019,37032] [2025-03-17 10:34:09,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i[47352,47365] [2025-03-17 10:34:09,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:34:09,270 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:34:09,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:09 WrapperNode [2025-03-17 10:34:09,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:34:09,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:34:09,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:34:09,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:34:09,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:09" (1/1) ... [2025-03-17 10:34:09,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:09" (1/1) ... [2025-03-17 10:34:09,338 INFO L138 Inliner]: procedures = 208, calls = 227, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1264 [2025-03-17 10:34:09,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:34:09,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:34:09,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:34:09,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:34:09,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:09" (1/1) ... [2025-03-17 10:34:09,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:09" (1/1) ... [2025-03-17 10:34:09,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:09" (1/1) ... [2025-03-17 10:34:09,397 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-03-17 10:34:09,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:09" (1/1) ... [2025-03-17 10:34:09,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:09" (1/1) ... [2025-03-17 10:34:09,420 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:09" (1/1) ... [2025-03-17 10:34:09,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:09" (1/1) ... [2025-03-17 10:34:09,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:09" (1/1) ... [2025-03-17 10:34:09,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:09" (1/1) ... [2025-03-17 10:34:09,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:34:09,437 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:34:09,438 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:34:09,438 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:34:09,438 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:09" (1/1) ... [2025-03-17 10:34:09,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:34:09,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:34:09,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 10:34:09,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 10:34:09,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:34:09,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:34:09,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 10:34:09,486 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:34:09,486 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:34:09,486 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 10:34:09,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:34:09,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:34:09,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:34:09,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:34:09,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:34:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:34:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:34:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:34:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 10:34:09,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 10:34:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:34:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:34:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:34:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:34:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:34:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:34:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:34:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:34:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:34:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:34:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:34:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:34:09,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:34:09,651 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:34:09,652 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:34:10,569 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-17 10:34:10,661 INFO L? ?]: Removed 302 outVars from TransFormulas that were not future-live. [2025-03-17 10:34:10,661 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:34:10,704 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:34:10,706 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 10:34:10,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:34:10 BoogieIcfgContainer [2025-03-17 10:34:10,707 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:34:10,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:34:10,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:34:10,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:34:10,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:34:08" (1/3) ... [2025-03-17 10:34:10,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790b929f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:34:10, skipping insertion in model container [2025-03-17 10:34:10,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:34:09" (2/3) ... [2025-03-17 10:34:10,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790b929f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:34:10, skipping insertion in model container [2025-03-17 10:34:10,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:34:10" (3/3) ... [2025-03-17 10:34:10,713 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test2-1.i [2025-03-17 10:34:10,723 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:34:10,724 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test2-1.i that has 5 procedures, 382 locations, 1 initial locations, 31 loop locations, and 2 error locations. [2025-03-17 10:34:10,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:34:10,777 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;@26b5ea75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:34:10,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 10:34:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 374 states, 361 states have (on average 1.6232686980609419) internal successors, (586), 368 states have internal predecessors, (586), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 10:34:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 10:34:10,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:10,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:10,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:10,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash 359114716, now seen corresponding path program 1 times [2025-03-17 10:34:10,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:10,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498230036] [2025-03-17 10:34:10,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:10,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:10,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 10:34:10,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 10:34:10,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:10,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:34:10,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:10,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498230036] [2025-03-17 10:34:10,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498230036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:10,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:10,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:34:10,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763926528] [2025-03-17 10:34:10,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:10,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 10:34:10,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:10,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 10:34:10,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:34:10,916 INFO L87 Difference]: Start difference. First operand has 374 states, 361 states have (on average 1.6232686980609419) internal successors, (586), 368 states have internal predecessors, (586), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:34:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:11,035 INFO L93 Difference]: Finished difference Result 747 states and 1208 transitions. [2025-03-17 10:34:11,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 10:34:11,038 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 10:34:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:11,047 INFO L225 Difference]: With dead ends: 747 [2025-03-17 10:34:11,048 INFO L226 Difference]: Without dead ends: 370 [2025-03-17 10:34:11,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:34:11,055 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:11,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:11,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-17 10:34:11,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-03-17 10:34:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 358 states have (on average 1.4692737430167597) internal successors, (526), 364 states have internal predecessors, (526), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 10:34:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 542 transitions. [2025-03-17 10:34:11,114 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 542 transitions. Word has length 8 [2025-03-17 10:34:11,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:11,114 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 542 transitions. [2025-03-17 10:34:11,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:34:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 542 transitions. [2025-03-17 10:34:11,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 10:34:11,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:11,119 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] [2025-03-17 10:34:11,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:34:11,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:11,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:11,120 INFO L85 PathProgramCache]: Analyzing trace with hash 708816651, now seen corresponding path program 1 times [2025-03-17 10:34:11,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:11,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009792230] [2025-03-17 10:34:11,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:11,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:11,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 10:34:11,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 10:34:11,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:11,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:11,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:34:11,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:11,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009792230] [2025-03-17 10:34:11,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009792230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:11,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:11,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:34:11,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850670682] [2025-03-17 10:34:11,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:11,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:34:11,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:11,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:34:11,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:34:11,564 INFO L87 Difference]: Start difference. First operand 370 states and 542 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:34:11,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:11,796 INFO L93 Difference]: Finished difference Result 901 states and 1330 transitions. [2025-03-17 10:34:11,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:34:11,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-17 10:34:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:11,800 INFO L225 Difference]: With dead ends: 901 [2025-03-17 10:34:11,802 INFO L226 Difference]: Without dead ends: 728 [2025-03-17 10:34:11,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:34:11,804 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 512 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:11,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1441 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:34:11,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2025-03-17 10:34:11,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 372. [2025-03-17 10:34:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 360 states have (on average 1.4666666666666666) internal successors, (528), 366 states have internal predecessors, (528), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 10:34:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 544 transitions. [2025-03-17 10:34:11,823 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 544 transitions. Word has length 61 [2025-03-17 10:34:11,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:11,824 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 544 transitions. [2025-03-17 10:34:11,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:34:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 544 transitions. [2025-03-17 10:34:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 10:34:11,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:11,827 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 10:34:11,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:34:11,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:11,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1819076144, now seen corresponding path program 1 times [2025-03-17 10:34:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028845540] [2025-03-17 10:34:11,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:11,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 10:34:11,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 10:34:11,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:11,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:34:12,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:12,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028845540] [2025-03-17 10:34:12,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028845540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:12,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:12,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:34:12,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580548224] [2025-03-17 10:34:12,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:12,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:34:12,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:12,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:34:12,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:34:12,137 INFO L87 Difference]: Start difference. First operand 372 states and 544 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:34:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:12,275 INFO L93 Difference]: Finished difference Result 699 states and 1019 transitions. [2025-03-17 10:34:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:34:12,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2025-03-17 10:34:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:12,278 INFO L225 Difference]: With dead ends: 699 [2025-03-17 10:34:12,278 INFO L226 Difference]: Without dead ends: 330 [2025-03-17 10:34:12,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:34:12,279 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 30 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:12,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1208 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-17 10:34:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-03-17 10:34:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 318 states have (on average 1.4182389937106918) internal successors, (451), 324 states have internal predecessors, (451), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 10:34:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 467 transitions. [2025-03-17 10:34:12,299 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 467 transitions. Word has length 135 [2025-03-17 10:34:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:12,299 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 467 transitions. [2025-03-17 10:34:12,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:34:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 467 transitions. [2025-03-17 10:34:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 10:34:12,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:12,306 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 10:34:12,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:34:12,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:12,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:12,307 INFO L85 PathProgramCache]: Analyzing trace with hash -104824617, now seen corresponding path program 1 times [2025-03-17 10:34:12,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:12,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68747457] [2025-03-17 10:34:12,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:12,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:12,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 10:34:12,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 10:34:12,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:12,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:34:12,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:12,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68747457] [2025-03-17 10:34:12,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68747457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:12,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:12,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:34:12,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459907207] [2025-03-17 10:34:12,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:12,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:34:12,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:12,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:34:12,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:34:12,499 INFO L87 Difference]: Start difference. First operand 330 states and 467 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:34:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:12,632 INFO L93 Difference]: Finished difference Result 887 states and 1270 transitions. [2025-03-17 10:34:12,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:34:12,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2025-03-17 10:34:12,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:12,635 INFO L225 Difference]: With dead ends: 887 [2025-03-17 10:34:12,635 INFO L226 Difference]: Without dead ends: 560 [2025-03-17 10:34:12,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:34:12,638 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 268 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:12,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1016 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:12,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-17 10:34:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 558. [2025-03-17 10:34:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 541 states have (on average 1.4362292051756007) internal successors, (777), 552 states have internal predecessors, (777), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:34:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 803 transitions. [2025-03-17 10:34:12,656 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 803 transitions. Word has length 135 [2025-03-17 10:34:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:12,657 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 803 transitions. [2025-03-17 10:34:12,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:34:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 803 transitions. [2025-03-17 10:34:12,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:34:12,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:12,659 INFO L218 NwaCegarLoop]: trace histogram [2, 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] [2025-03-17 10:34:12,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:34:12,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:12,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:12,660 INFO L85 PathProgramCache]: Analyzing trace with hash 700745260, now seen corresponding path program 1 times [2025-03-17 10:34:12,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:12,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119338955] [2025-03-17 10:34:12,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:12,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:12,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:34:12,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:34:12,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:12,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 10:34:12,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:12,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119338955] [2025-03-17 10:34:12,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119338955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:12,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:12,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:34:12,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446135018] [2025-03-17 10:34:12,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:12,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:34:12,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:12,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:34:12,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:34:12,971 INFO L87 Difference]: Start difference. First operand 558 states and 803 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:13,089 INFO L93 Difference]: Finished difference Result 913 states and 1339 transitions. [2025-03-17 10:34:13,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:34:13,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 150 [2025-03-17 10:34:13,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:13,096 INFO L225 Difference]: With dead ends: 913 [2025-03-17 10:34:13,096 INFO L226 Difference]: Without dead ends: 598 [2025-03-17 10:34:13,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:34:13,097 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 8 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:13,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 799 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:13,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-03-17 10:34:13,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2025-03-17 10:34:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 581 states have (on average 1.4061962134251291) internal successors, (817), 592 states have internal predecessors, (817), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:34:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 843 transitions. [2025-03-17 10:34:13,120 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 843 transitions. Word has length 150 [2025-03-17 10:34:13,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:13,121 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 843 transitions. [2025-03-17 10:34:13,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:13,121 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 843 transitions. [2025-03-17 10:34:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:34:13,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:13,123 INFO L218 NwaCegarLoop]: trace histogram [2, 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] [2025-03-17 10:34:13,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:34:13,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:13,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:13,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1725439181, now seen corresponding path program 1 times [2025-03-17 10:34:13,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:13,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101337959] [2025-03-17 10:34:13,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:13,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:13,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:34:13,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:34:13,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:13,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 10:34:13,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:13,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101337959] [2025-03-17 10:34:13,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101337959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:13,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:13,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:34:13,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279314828] [2025-03-17 10:34:13,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:13,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:34:13,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:13,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:34:13,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:34:13,366 INFO L87 Difference]: Start difference. First operand 598 states and 843 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:13,468 INFO L93 Difference]: Finished difference Result 829 states and 1181 transitions. [2025-03-17 10:34:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:34:13,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 150 [2025-03-17 10:34:13,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:13,472 INFO L225 Difference]: With dead ends: 829 [2025-03-17 10:34:13,472 INFO L226 Difference]: Without dead ends: 474 [2025-03-17 10:34:13,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:34:13,477 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 32 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:13,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 982 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:34:13,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-03-17 10:34:13,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2025-03-17 10:34:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 457 states have (on average 1.350109409190372) internal successors, (617), 468 states have internal predecessors, (617), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:34:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 643 transitions. [2025-03-17 10:34:13,502 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 643 transitions. Word has length 150 [2025-03-17 10:34:13,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:13,503 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 643 transitions. [2025-03-17 10:34:13,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 643 transitions. [2025-03-17 10:34:13,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:34:13,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:13,505 INFO L218 NwaCegarLoop]: trace histogram [2, 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] [2025-03-17 10:34:13,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:34:13,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:13,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:13,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1693705178, now seen corresponding path program 1 times [2025-03-17 10:34:13,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:13,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469479160] [2025-03-17 10:34:13,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:13,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:13,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:34:13,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:34:13,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:13,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:13,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:13,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469479160] [2025-03-17 10:34:13,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469479160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:13,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:13,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:34:13,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996647435] [2025-03-17 10:34:13,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:13,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:34:13,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:13,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:34:13,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:34:13,721 INFO L87 Difference]: Start difference. First operand 474 states and 643 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:14,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:14,712 INFO L93 Difference]: Finished difference Result 938 states and 1272 transitions. [2025-03-17 10:34:14,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:34:14,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 150 [2025-03-17 10:34:14,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:14,715 INFO L225 Difference]: With dead ends: 938 [2025-03-17 10:34:14,715 INFO L226 Difference]: Without dead ends: 552 [2025-03-17 10:34:14,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:34:14,716 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 903 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:14,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 863 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 10:34:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-17 10:34:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 373. [2025-03-17 10:34:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 361 states have (on average 1.3434903047091413) internal successors, (485), 367 states have internal predecessors, (485), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 10:34:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 501 transitions. [2025-03-17 10:34:14,733 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 501 transitions. Word has length 150 [2025-03-17 10:34:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:14,734 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 501 transitions. [2025-03-17 10:34:14,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 501 transitions. [2025-03-17 10:34:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 10:34:14,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:14,735 INFO L218 NwaCegarLoop]: trace histogram [2, 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] [2025-03-17 10:34:14,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:34:14,735 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:14,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:14,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1456256296, now seen corresponding path program 1 times [2025-03-17 10:34:14,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:14,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934984793] [2025-03-17 10:34:14,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:14,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:14,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 10:34:14,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 10:34:14,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:14,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:15,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:15,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934984793] [2025-03-17 10:34:15,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934984793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:34:15,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469788235] [2025-03-17 10:34:15,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:15,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:34:15,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:34:15,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:34:15,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 10:34:15,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 10:34:15,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 10:34:15,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:15,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:15,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 10:34:15,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:34:15,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 10:34:15,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-17 10:34:15,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 10:34:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:15,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:34:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:15,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469788235] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:34:15,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:34:15,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-03-17 10:34:15,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639428726] [2025-03-17 10:34:15,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:34:15,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 10:34:15,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:15,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 10:34:15,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-17 10:34:15,996 INFO L87 Difference]: Start difference. First operand 373 states and 501 transitions. Second operand has 11 states, 11 states have (on average 28.818181818181817) internal successors, (317), 11 states have internal predecessors, (317), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 10:34:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:16,402 INFO L93 Difference]: Finished difference Result 1237 states and 1669 transitions. [2025-03-17 10:34:16,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 10:34:16,403 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 28.818181818181817) internal successors, (317), 11 states have internal predecessors, (317), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 160 [2025-03-17 10:34:16,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:16,407 INFO L225 Difference]: With dead ends: 1237 [2025-03-17 10:34:16,407 INFO L226 Difference]: Without dead ends: 1106 [2025-03-17 10:34:16,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 313 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-17 10:34:16,408 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 1618 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:16,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1632 Valid, 2066 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:34:16,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-03-17 10:34:16,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 713. [2025-03-17 10:34:16,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 697 states have (on average 1.3414634146341464) internal successors, (935), 703 states have internal predecessors, (935), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 10:34:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 957 transitions. [2025-03-17 10:34:16,427 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 957 transitions. Word has length 160 [2025-03-17 10:34:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:16,427 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 957 transitions. [2025-03-17 10:34:16,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.818181818181817) internal successors, (317), 11 states have internal predecessors, (317), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 10:34:16,427 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 957 transitions. [2025-03-17 10:34:16,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-03-17 10:34:16,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:16,430 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:16,439 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:34:16,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:34:16,631 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:16,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:16,632 INFO L85 PathProgramCache]: Analyzing trace with hash -329879940, now seen corresponding path program 1 times [2025-03-17 10:34:16,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:16,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446142552] [2025-03-17 10:34:16,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:16,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:16,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-17 10:34:16,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-17 10:34:16,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:16,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:19,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:19,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446142552] [2025-03-17 10:34:19,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446142552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:34:19,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430697539] [2025-03-17 10:34:19,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:19,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:34:19,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:34:19,209 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:34:19,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 10:34:19,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-17 10:34:19,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-17 10:34:19,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:19,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:19,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 1893 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 10:34:19,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:34:19,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 10:34:19,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-17 10:34:20,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:34:20,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:34:20,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:34:20,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 10:34:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:20,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:34:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:34:20,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430697539] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:34:20,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:34:20,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2025-03-17 10:34:20,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206896833] [2025-03-17 10:34:20,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:34:20,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 10:34:20,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:20,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 10:34:20,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-17 10:34:20,653 INFO L87 Difference]: Start difference. First operand 713 states and 957 transitions. Second operand has 20 states, 20 states have (on average 38.35) internal successors, (767), 20 states have internal predecessors, (767), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 10:34:21,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:21,337 INFO L93 Difference]: Finished difference Result 2455 states and 3322 transitions. [2025-03-17 10:34:21,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 10:34:21,338 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 38.35) internal successors, (767), 20 states have internal predecessors, (767), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 382 [2025-03-17 10:34:21,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:21,346 INFO L225 Difference]: With dead ends: 2455 [2025-03-17 10:34:21,346 INFO L226 Difference]: Without dead ends: 2324 [2025-03-17 10:34:21,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 783 GetRequests, 756 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2025-03-17 10:34:21,348 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 3914 mSDsluCounter, 3901 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3949 SdHoareTripleChecker+Valid, 4273 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:21,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3949 Valid, 4273 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:34:21,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2025-03-17 10:34:21,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 1559. [2025-03-17 10:34:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1537 states have (on average 1.3422251138581653) internal successors, (2063), 1543 states have internal predecessors, (2063), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 10:34:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2097 transitions. [2025-03-17 10:34:21,389 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2097 transitions. Word has length 382 [2025-03-17 10:34:21,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:21,389 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2097 transitions. [2025-03-17 10:34:21,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.35) internal successors, (767), 20 states have internal predecessors, (767), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 10:34:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2097 transitions. [2025-03-17 10:34:21,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2025-03-17 10:34:21,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:21,401 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:21,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 10:34:21,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-17 10:34:21,601 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:21,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:21,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2138443580, now seen corresponding path program 2 times [2025-03-17 10:34:21,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:21,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230693842] [2025-03-17 10:34:21,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:34:21,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:21,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 826 statements into 2 equivalence classes. [2025-03-17 10:34:21,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 71 of 826 statements. [2025-03-17 10:34:21,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:34:21,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-17 10:34:21,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:21,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230693842] [2025-03-17 10:34:21,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230693842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:21,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:21,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:34:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394471869] [2025-03-17 10:34:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:21,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:34:21,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:21,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:34:21,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:34:21,942 INFO L87 Difference]: Start difference. First operand 1559 states and 2097 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:22,249 INFO L93 Difference]: Finished difference Result 1729 states and 2328 transitions. [2025-03-17 10:34:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:34:22,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 826 [2025-03-17 10:34:22,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:22,257 INFO L225 Difference]: With dead ends: 1729 [2025-03-17 10:34:22,258 INFO L226 Difference]: Without dead ends: 1599 [2025-03-17 10:34:22,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:34:22,259 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 80 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:22,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1547 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:34:22,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-03-17 10:34:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1561. [2025-03-17 10:34:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1539 states have (on average 1.3417803768680963) internal successors, (2065), 1545 states have internal predecessors, (2065), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 10:34:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2099 transitions. [2025-03-17 10:34:22,309 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2099 transitions. Word has length 826 [2025-03-17 10:34:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:22,310 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 2099 transitions. [2025-03-17 10:34:22,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:22,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2099 transitions. [2025-03-17 10:34:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2025-03-17 10:34:22,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:22,326 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:22,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:34:22,326 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:22,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:22,327 INFO L85 PathProgramCache]: Analyzing trace with hash -434437926, now seen corresponding path program 1 times [2025-03-17 10:34:22,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:22,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343941535] [2025-03-17 10:34:22,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:22,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:22,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 827 statements into 1 equivalence classes. [2025-03-17 10:34:22,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 827 of 827 statements. [2025-03-17 10:34:22,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:22,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-17 10:34:24,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:24,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343941535] [2025-03-17 10:34:24,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343941535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:24,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:24,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:34:24,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706924221] [2025-03-17 10:34:24,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:24,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:34:24,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:24,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:34:24,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:34:24,789 INFO L87 Difference]: Start difference. First operand 1561 states and 2099 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:25,104 INFO L93 Difference]: Finished difference Result 1698 states and 2284 transitions. [2025-03-17 10:34:25,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:34:25,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 827 [2025-03-17 10:34:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:25,110 INFO L225 Difference]: With dead ends: 1698 [2025-03-17 10:34:25,110 INFO L226 Difference]: Without dead ends: 1566 [2025-03-17 10:34:25,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:34:25,112 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 14 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:25,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1432 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:34:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2025-03-17 10:34:25,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1565. [2025-03-17 10:34:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1543 states have (on average 1.3415424497731692) internal successors, (2070), 1549 states have internal predecessors, (2070), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 10:34:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2104 transitions. [2025-03-17 10:34:25,147 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2104 transitions. Word has length 827 [2025-03-17 10:34:25,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:25,148 INFO L471 AbstractCegarLoop]: Abstraction has 1565 states and 2104 transitions. [2025-03-17 10:34:25,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2104 transitions. [2025-03-17 10:34:25,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-17 10:34:25,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:25,154 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:25,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:34:25,154 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:25,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:25,155 INFO L85 PathProgramCache]: Analyzing trace with hash 331385515, now seen corresponding path program 1 times [2025-03-17 10:34:25,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:25,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936630036] [2025-03-17 10:34:25,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:25,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:25,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-17 10:34:25,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-17 10:34:25,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:34:25,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:34:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-17 10:34:26,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:34:26,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936630036] [2025-03-17 10:34:26,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936630036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:34:26,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:34:26,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:34:26,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119986163] [2025-03-17 10:34:26,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:34:26,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:34:26,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:34:26,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:34:26,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:34:26,976 INFO L87 Difference]: Start difference. First operand 1565 states and 2104 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:27,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:34:27,467 INFO L93 Difference]: Finished difference Result 1712 states and 2303 transitions. [2025-03-17 10:34:27,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:34:27,467 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 828 [2025-03-17 10:34:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:34:27,474 INFO L225 Difference]: With dead ends: 1712 [2025-03-17 10:34:27,474 INFO L226 Difference]: Without dead ends: 1576 [2025-03-17 10:34:27,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:34:27,475 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 31 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:34:27,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2352 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:34:27,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2025-03-17 10:34:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1573. [2025-03-17 10:34:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1551 states have (on average 1.3404255319148937) internal successors, (2079), 1557 states have internal predecessors, (2079), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 10:34:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2113 transitions. [2025-03-17 10:34:27,538 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2113 transitions. Word has length 828 [2025-03-17 10:34:27,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:34:27,538 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2113 transitions. [2025-03-17 10:34:27,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:34:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2113 transitions. [2025-03-17 10:34:27,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-17 10:34:27,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:34:27,545 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:34:27,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:34:27,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:34:27,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:34:27,546 INFO L85 PathProgramCache]: Analyzing trace with hash 952959664, now seen corresponding path program 1 times [2025-03-17 10:34:27,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:34:27,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957132465] [2025-03-17 10:34:27,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:34:27,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:34:27,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes.