./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d993ff45e37665d9abd93530677e1201b0648bf8ee13fa84b0c68926f580d988 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:17:04,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:17:04,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 06:17:04,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:17:04,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:17:04,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:17:04,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:17:04,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:17:04,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 06:17:04,214 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 06:17:04,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:17:04,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:17:04,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:17:04,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:17:04,214 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:17:04,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:17:04,214 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:17:04,214 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:17:04,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:17:04,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:17:04,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:17:04,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:17:04,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:17:04,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:17:04,215 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:17:04,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:17:04,215 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:17:04,215 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:17:04,215 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:17:04,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:17:04,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 06:17:04,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:17:04,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:17:04,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:17:04,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:17:04,216 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:17:04,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:17:04,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:17:04,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:17:04,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:17:04,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:17:04,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:17:04,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:17:04,216 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 -> d993ff45e37665d9abd93530677e1201b0648bf8ee13fa84b0c68926f580d988 [2025-03-04 06:17:04,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:17:04,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:17:04,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:17:04,434 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:17:04,434 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:17:04,435 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_test9-2.i [2025-03-04 06:17:05,570 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b3e292a/8a57d81e0a67448788f1f19cad3cfe5a/FLAGc30101480 [2025-03-04 06:17:05,961 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:17:05,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i [2025-03-04 06:17:05,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b3e292a/8a57d81e0a67448788f1f19cad3cfe5a/FLAGc30101480 [2025-03-04 06:17:06,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b3e292a/8a57d81e0a67448788f1f19cad3cfe5a [2025-03-04 06:17:06,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:17:06,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:17:06,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:17:06,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:17:06,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:17:06,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:17:06" (1/1) ... [2025-03-04 06:17:06,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ff8acf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:06, skipping insertion in model container [2025-03-04 06:17:06,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:17:06" (1/1) ... [2025-03-04 06:17:06,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:17:06,470 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_test9-2.i[33021,33034] [2025-03-04 06:17:06,620 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_test9-2.i[84583,84596] [2025-03-04 06:17:06,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:17:06,635 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:17:06,656 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_test9-2.i[33021,33034] [2025-03-04 06:17:06,739 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_test9-2.i[84583,84596] [2025-03-04 06:17:06,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:17:06,766 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:17:06,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:06 WrapperNode [2025-03-04 06:17:06,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:17:06,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:17:06,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:17:06,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:17:06,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:06" (1/1) ... [2025-03-04 06:17:06,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:06" (1/1) ... [2025-03-04 06:17:06,882 INFO L138 Inliner]: procedures = 177, calls = 773, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3403 [2025-03-04 06:17:06,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:17:06,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:17:06,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:17:06,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:17:06,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:06" (1/1) ... [2025-03-04 06:17:06,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:06" (1/1) ... [2025-03-04 06:17:06,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:06" (1/1) ... [2025-03-04 06:17:06,981 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-03-04 06:17:06,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:06" (1/1) ... [2025-03-04 06:17:06,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:06" (1/1) ... [2025-03-04 06:17:07,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:06" (1/1) ... [2025-03-04 06:17:07,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:06" (1/1) ... [2025-03-04 06:17:07,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:06" (1/1) ... [2025-03-04 06:17:07,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:06" (1/1) ... [2025-03-04 06:17:07,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:17:07,094 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:17:07,094 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:17:07,094 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:17:07,095 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:06" (1/1) ... [2025-03-04 06:17:07,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:17:07,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:17:07,121 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-04 06:17:07,125 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-04 06:17:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 06:17:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 06:17:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 06:17:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 06:17:07,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 06:17:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 06:17:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 06:17:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 06:17:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 06:17:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 06:17:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 06:17:07,145 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 06:17:07,145 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 06:17:07,145 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 06:17:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:17:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:17:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 06:17:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 06:17:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 06:17:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:17:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 06:17:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 06:17:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 06:17:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:17:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 06:17:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 06:17:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 06:17:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:17:07,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:17:07,322 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:17:07,324 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:17:09,292 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: 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-04 06:17:09,504 INFO L? ?]: Removed 823 outVars from TransFormulas that were not future-live. [2025-03-04 06:17:09,505 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:17:09,572 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:17:09,572 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 06:17:09,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:17:09 BoogieIcfgContainer [2025-03-04 06:17:09,573 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:17:09,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:17:09,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:17:09,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:17:09,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:17:06" (1/3) ... [2025-03-04 06:17:09,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb08a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:17:09, skipping insertion in model container [2025-03-04 06:17:09,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:06" (2/3) ... [2025-03-04 06:17:09,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb08a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:17:09, skipping insertion in model container [2025-03-04 06:17:09,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:17:09" (3/3) ... [2025-03-04 06:17:09,581 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test9-2.i [2025-03-04 06:17:09,590 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:17:09,592 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test9-2.i that has 5 procedures, 1407 locations, 1 initial locations, 36 loop locations, and 2 error locations. [2025-03-04 06:17:09,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:17:09,677 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;@48781c68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:17:09,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 06:17:09,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 1399 states, 891 states have (on average 1.8316498316498318) internal successors, (1632), 1393 states have internal predecessors, (1632), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-04 06:17:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 06:17:09,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:09,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:17:09,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:09,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:09,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1715556443, now seen corresponding path program 1 times [2025-03-04 06:17:09,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:09,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969409789] [2025-03-04 06:17:09,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:09,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:09,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 06:17:09,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 06:17:09,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:09,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:09,827 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-04 06:17:09,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:09,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969409789] [2025-03-04 06:17:09,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969409789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:09,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:09,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:17:09,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835608349] [2025-03-04 06:17:09,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:09,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:17:09,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:09,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:17:09,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:17:09,847 INFO L87 Difference]: Start difference. First operand has 1399 states, 891 states have (on average 1.8316498316498318) internal successors, (1632), 1393 states have internal predecessors, (1632), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-04 06:17:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:10,047 INFO L93 Difference]: Finished difference Result 2796 states and 5774 transitions. [2025-03-04 06:17:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:17:10,049 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2025-03-04 06:17:10,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:10,072 INFO L225 Difference]: With dead ends: 2796 [2025-03-04 06:17:10,073 INFO L226 Difference]: Without dead ends: 1362 [2025-03-04 06:17:10,083 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-04 06:17:10,085 INFO L435 NwaCegarLoop]: 2532 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:10,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2532 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:17:10,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2025-03-04 06:17:10,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2025-03-04 06:17:10,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 855 states have (on average 1.775438596491228) internal successors, (1518), 1356 states have internal predecessors, (1518), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-04 06:17:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2524 transitions. [2025-03-04 06:17:10,387 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2524 transitions. Word has length 9 [2025-03-04 06:17:10,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:10,388 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 2524 transitions. [2025-03-04 06:17:10,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-04 06:17:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2524 transitions. [2025-03-04 06:17:10,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 06:17:10,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:10,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:17:10,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:17:10,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:10,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:10,393 INFO L85 PathProgramCache]: Analyzing trace with hash 726888382, now seen corresponding path program 1 times [2025-03-04 06:17:10,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:10,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061977668] [2025-03-04 06:17:10,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:10,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:10,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:17:10,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:17:10,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:10,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:10,754 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-04 06:17:10,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:10,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061977668] [2025-03-04 06:17:10,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061977668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:10,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:10,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:17:10,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727544518] [2025-03-04 06:17:10,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:10,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:17:10,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:10,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:17:10,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:17:10,756 INFO L87 Difference]: Start difference. First operand 1362 states and 2524 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-04 06:17:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:11,590 INFO L93 Difference]: Finished difference Result 3875 states and 7274 transitions. [2025-03-04 06:17:11,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:17:11,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2025-03-04 06:17:11,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:11,609 INFO L225 Difference]: With dead ends: 3875 [2025-03-04 06:17:11,609 INFO L226 Difference]: Without dead ends: 2711 [2025-03-04 06:17:11,613 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-04 06:17:11,614 INFO L435 NwaCegarLoop]: 2703 mSDtfsCounter, 1503 mSDsluCounter, 4661 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 7364 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:11,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2006 Valid, 7364 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:17:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2025-03-04 06:17:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 1364. [2025-03-04 06:17:11,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 857 states have (on average 1.7736289381563595) internal successors, (1520), 1358 states have internal predecessors, (1520), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-04 06:17:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2526 transitions. [2025-03-04 06:17:11,836 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2526 transitions. Word has length 62 [2025-03-04 06:17:11,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:11,836 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 2526 transitions. [2025-03-04 06:17:11,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-04 06:17:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2526 transitions. [2025-03-04 06:17:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 06:17:11,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:11,845 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, 1] [2025-03-04 06:17:11,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:17:11,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:11,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:11,846 INFO L85 PathProgramCache]: Analyzing trace with hash 54422276, now seen corresponding path program 1 times [2025-03-04 06:17:11,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:11,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277450840] [2025-03-04 06:17:11,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:11,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:11,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 06:17:11,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 06:17:11,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:11,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:12,175 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-04 06:17:12,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:12,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277450840] [2025-03-04 06:17:12,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277450840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:12,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:12,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:17:12,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485081029] [2025-03-04 06:17:12,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:12,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:17:12,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:12,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:17:12,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:17:12,176 INFO L87 Difference]: Start difference. First operand 1364 states and 2526 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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-04 06:17:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:12,328 INFO L93 Difference]: Finished difference Result 2682 states and 4982 transitions. [2025-03-04 06:17:12,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:17:12,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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 136 [2025-03-04 06:17:12,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:12,339 INFO L225 Difference]: With dead ends: 2682 [2025-03-04 06:17:12,340 INFO L226 Difference]: Without dead ends: 1322 [2025-03-04 06:17:12,343 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-04 06:17:12,345 INFO L435 NwaCegarLoop]: 2391 mSDtfsCounter, 30 mSDsluCounter, 4763 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7154 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-04 06:17:12,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7154 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:17:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-03-04 06:17:12,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1322. [2025-03-04 06:17:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 815 states have (on average 1.7705521472392638) internal successors, (1443), 1316 states have internal predecessors, (1443), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-04 06:17:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2449 transitions. [2025-03-04 06:17:12,482 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2449 transitions. Word has length 136 [2025-03-04 06:17:12,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:12,482 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 2449 transitions. [2025-03-04 06:17:12,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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-04 06:17:12,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2449 transitions. [2025-03-04 06:17:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 06:17:12,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:12,484 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, 1] [2025-03-04 06:17:12,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:17:12,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:12,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:12,485 INFO L85 PathProgramCache]: Analyzing trace with hash -622833398, now seen corresponding path program 1 times [2025-03-04 06:17:12,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:12,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081925027] [2025-03-04 06:17:12,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:12,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:12,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 06:17:12,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 06:17:12,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:12,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:12,669 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-04 06:17:12,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081925027] [2025-03-04 06:17:12,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081925027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:12,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:12,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:17:12,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692100243] [2025-03-04 06:17:12,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:12,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:17:12,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:12,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:17:12,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:17:12,671 INFO L87 Difference]: Start difference. First operand 1322 states and 2449 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-04 06:17:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:12,873 INFO L93 Difference]: Finished difference Result 3861 states and 7214 transitions. [2025-03-04 06:17:12,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:17:12,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 136 [2025-03-04 06:17:12,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:12,892 INFO L225 Difference]: With dead ends: 3861 [2025-03-04 06:17:12,892 INFO L226 Difference]: Without dead ends: 2543 [2025-03-04 06:17:12,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:17:12,897 INFO L435 NwaCegarLoop]: 2821 mSDtfsCounter, 1259 mSDsluCounter, 2395 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 5216 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-04 06:17:12,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 5216 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:17:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2025-03-04 06:17:13,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2541. [2025-03-04 06:17:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 1534 states have (on average 1.7992177314211213) internal successors, (2760), 2535 states have internal predecessors, (2760), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-04 06:17:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4766 transitions. [2025-03-04 06:17:13,131 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4766 transitions. Word has length 136 [2025-03-04 06:17:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:13,131 INFO L471 AbstractCegarLoop]: Abstraction has 2541 states and 4766 transitions. [2025-03-04 06:17:13,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-04 06:17:13,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4766 transitions. [2025-03-04 06:17:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 06:17:13,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:13,132 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] [2025-03-04 06:17:13,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:17:13,133 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:13,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:13,133 INFO L85 PathProgramCache]: Analyzing trace with hash 960578731, now seen corresponding path program 1 times [2025-03-04 06:17:13,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:13,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630997832] [2025-03-04 06:17:13,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:13,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:13,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 06:17:13,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 06:17:13,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:13,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:13,319 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-04 06:17:13,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:13,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630997832] [2025-03-04 06:17:13,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630997832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:13,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:13,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:17:13,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332318048] [2025-03-04 06:17:13,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:13,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:17:13,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:13,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:17:13,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:17:13,321 INFO L87 Difference]: Start difference. First operand 2541 states and 4766 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 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-04 06:17:13,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:13,487 INFO L93 Difference]: Finished difference Result 4878 states and 9264 transitions. [2025-03-04 06:17:13,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:17:13,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 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 151 [2025-03-04 06:17:13,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:13,506 INFO L225 Difference]: With dead ends: 4878 [2025-03-04 06:17:13,506 INFO L226 Difference]: Without dead ends: 2581 [2025-03-04 06:17:13,513 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-04 06:17:13,514 INFO L435 NwaCegarLoop]: 2389 mSDtfsCounter, 8 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4763 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-04 06:17:13,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4763 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:17:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2025-03-04 06:17:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 2581. [2025-03-04 06:17:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2581 states, 1574 states have (on average 1.7789072426937738) internal successors, (2800), 2575 states have internal predecessors, (2800), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-04 06:17:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 4806 transitions. [2025-03-04 06:17:13,748 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 4806 transitions. Word has length 151 [2025-03-04 06:17:13,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:13,749 INFO L471 AbstractCegarLoop]: Abstraction has 2581 states and 4806 transitions. [2025-03-04 06:17:13,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 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-04 06:17:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 4806 transitions. [2025-03-04 06:17:13,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 06:17:13,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:13,750 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] [2025-03-04 06:17:13,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:17:13,750 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:13,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:13,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1324284724, now seen corresponding path program 1 times [2025-03-04 06:17:13,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:13,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788556048] [2025-03-04 06:17:13,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:13,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:13,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 06:17:13,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 06:17:13,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:13,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:13,972 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-04 06:17:13,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:13,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788556048] [2025-03-04 06:17:13,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788556048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:13,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:13,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:17:13,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825515550] [2025-03-04 06:17:13,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:13,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:17:13,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:13,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:17:13,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:17:13,974 INFO L87 Difference]: Start difference. First operand 2581 states and 4806 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 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-04 06:17:14,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:14,135 INFO L93 Difference]: Finished difference Result 4794 states and 9106 transitions. [2025-03-04 06:17:14,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:17:14,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 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 151 [2025-03-04 06:17:14,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:14,156 INFO L225 Difference]: With dead ends: 4794 [2025-03-04 06:17:14,157 INFO L226 Difference]: Without dead ends: 2457 [2025-03-04 06:17:14,164 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-04 06:17:14,165 INFO L435 NwaCegarLoop]: 2314 mSDtfsCounter, 32 mSDsluCounter, 4614 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6928 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-04 06:17:14,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6928 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:17:14,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2025-03-04 06:17:14,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2457. [2025-03-04 06:17:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 1450 states have (on average 1.793103448275862) internal successors, (2600), 2451 states have internal predecessors, (2600), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-04 06:17:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 4606 transitions. [2025-03-04 06:17:14,470 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 4606 transitions. Word has length 151 [2025-03-04 06:17:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:14,471 INFO L471 AbstractCegarLoop]: Abstraction has 2457 states and 4606 transitions. [2025-03-04 06:17:14,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 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-04 06:17:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 4606 transitions. [2025-03-04 06:17:14,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 06:17:14,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:14,475 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] [2025-03-04 06:17:14,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:17:14,476 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:14,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:14,476 INFO L85 PathProgramCache]: Analyzing trace with hash -448461787, now seen corresponding path program 1 times [2025-03-04 06:17:14,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:14,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914903828] [2025-03-04 06:17:14,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:14,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:14,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 06:17:14,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 06:17:14,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:14,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:14,709 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-04 06:17:14,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:14,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914903828] [2025-03-04 06:17:14,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914903828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:14,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:14,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:17:14,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784393093] [2025-03-04 06:17:14,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:14,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:17:14,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:14,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:17:14,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:17:14,712 INFO L87 Difference]: Start difference. First operand 2457 states and 4606 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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-04 06:17:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:15,870 INFO L93 Difference]: Finished difference Result 3733 states and 6971 transitions. [2025-03-04 06:17:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:17:15,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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 151 [2025-03-04 06:17:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:15,881 INFO L225 Difference]: With dead ends: 3733 [2025-03-04 06:17:15,881 INFO L226 Difference]: Without dead ends: 1365 [2025-03-04 06:17:15,889 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-04 06:17:15,890 INFO L435 NwaCegarLoop]: 2395 mSDtfsCounter, 2541 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1003 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2541 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1003 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:15,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2541 Valid, 3524 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1003 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 06:17:15,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2025-03-04 06:17:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1365. [2025-03-04 06:17:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 858 states have (on average 1.7214452214452214) internal successors, (1477), 1359 states have internal predecessors, (1477), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-04 06:17:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2483 transitions. [2025-03-04 06:17:16,038 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2483 transitions. Word has length 151 [2025-03-04 06:17:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:16,038 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 2483 transitions. [2025-03-04 06:17:16,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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-04 06:17:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2483 transitions. [2025-03-04 06:17:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 06:17:16,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:16,042 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, 1] [2025-03-04 06:17:16,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:17:16,042 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:16,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:16,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1549615959, now seen corresponding path program 1 times [2025-03-04 06:17:16,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:16,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566390302] [2025-03-04 06:17:16,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:16,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:16,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 06:17:16,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 06:17:16,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:16,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:16,609 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-04 06:17:16,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:16,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566390302] [2025-03-04 06:17:16,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566390302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:17:16,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262139829] [2025-03-04 06:17:16,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:16,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:17:16,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:17:16,613 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-04 06:17:16,614 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-04 06:17:16,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 06:17:16,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 06:17:16,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:16,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:16,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 06:17:16,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:17:16,910 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-04 06:17:17,102 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-04 06:17:17,110 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-04 06:17:17,116 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-04 06:17:17,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:17:17,259 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-04 06:17:17,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262139829] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:17:17,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:17:17,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-04 06:17:17,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449782532] [2025-03-04 06:17:17,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:17:17,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:17:17,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:17,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:17:17,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:17:17,261 INFO L87 Difference]: Start difference. First operand 1365 states and 2483 transitions. Second operand has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 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-04 06:17:22,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:22,026 INFO L93 Difference]: Finished difference Result 5202 states and 9594 transitions. [2025-03-04 06:17:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 06:17:22,027 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 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 161 [2025-03-04 06:17:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:22,046 INFO L225 Difference]: With dead ends: 5202 [2025-03-04 06:17:22,046 INFO L226 Difference]: Without dead ends: 4080 [2025-03-04 06:17:22,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 315 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-04 06:17:22,050 INFO L435 NwaCegarLoop]: 1859 mSDtfsCounter, 2992 mSDsluCounter, 12482 mSDsCounter, 0 mSdLazyCounter, 5837 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3996 SdHoareTripleChecker+Valid, 14341 SdHoareTripleChecker+Invalid, 6342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 5837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:22,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3996 Valid, 14341 Invalid, 6342 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [505 Valid, 5837 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-04 06:17:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4080 states. [2025-03-04 06:17:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4080 to 1705. [2025-03-04 06:17:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1194 states have (on average 1.6139028475711892) internal successors, (1927), 1695 states have internal predecessors, (1927), 506 states have call successors, (506), 3 states have call predecessors, (506), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2025-03-04 06:17:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2939 transitions. [2025-03-04 06:17:22,360 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2939 transitions. Word has length 161 [2025-03-04 06:17:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:22,361 INFO L471 AbstractCegarLoop]: Abstraction has 1705 states and 2939 transitions. [2025-03-04 06:17:22,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 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-04 06:17:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2939 transitions. [2025-03-04 06:17:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-04 06:17:22,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:22,365 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, 1] [2025-03-04 06:17:22,373 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-04 06:17:22,565 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-04 06:17:22,566 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:22,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:22,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1591850885, now seen corresponding path program 1 times [2025-03-04 06:17:22,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:22,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977656633] [2025-03-04 06:17:22,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:22,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:22,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-04 06:17:22,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-04 06:17:22,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:22,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:25,161 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-04 06:17:25,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:25,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977656633] [2025-03-04 06:17:25,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977656633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:17:25,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373165571] [2025-03-04 06:17:25,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:25,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:17:25,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:17:25,165 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-04 06:17:25,166 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-04 06:17:25,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-04 06:17:25,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-04 06:17:25,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:25,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:25,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 1893 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:17:25,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:17:25,653 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-04 06:17:25,832 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-04 06:17:25,920 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-04 06:17:25,991 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-04 06:17:26,079 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-04 06:17:26,088 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-04 06:17:26,091 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-04 06:17:26,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:17:26,491 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-04 06:17:26,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373165571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:17:26,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:17:26,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2025-03-04 06:17:26,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732574965] [2025-03-04 06:17:26,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:17:26,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 06:17:26,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:26,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 06:17:26,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-04 06:17:26,494 INFO L87 Difference]: Start difference. First operand 1705 states and 2939 transitions. Second operand has 20 states, 20 states have (on average 38.4) internal successors, (768), 20 states have internal predecessors, (768), 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-04 06:17:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:36,382 INFO L93 Difference]: Finished difference Result 10508 states and 19341 transitions. [2025-03-04 06:17:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 06:17:36,383 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 38.4) internal successors, (768), 20 states have internal predecessors, (768), 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 383 [2025-03-04 06:17:36,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:36,428 INFO L225 Difference]: With dead ends: 10508 [2025-03-04 06:17:36,428 INFO L226 Difference]: Without dead ends: 9386 [2025-03-04 06:17:36,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 758 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-04 06:17:36,434 INFO L435 NwaCegarLoop]: 1859 mSDtfsCounter, 14742 mSDsluCounter, 21024 mSDsCounter, 0 mSdLazyCounter, 11868 mSolverCounterSat, 2206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17752 SdHoareTripleChecker+Valid, 22883 SdHoareTripleChecker+Invalid, 14074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2206 IncrementalHoareTripleChecker+Valid, 11868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:36,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17752 Valid, 22883 Invalid, 14074 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2206 Valid, 11868 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2025-03-04 06:17:36,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9386 states. [2025-03-04 06:17:37,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9386 to 2551. [2025-03-04 06:17:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2034 states have (on average 1.5019665683382497) internal successors, (3055), 2535 states have internal predecessors, (3055), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-04 06:17:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4079 transitions. [2025-03-04 06:17:37,194 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4079 transitions. Word has length 383 [2025-03-04 06:17:37,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:37,195 INFO L471 AbstractCegarLoop]: Abstraction has 2551 states and 4079 transitions. [2025-03-04 06:17:37,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.4) internal successors, (768), 20 states have internal predecessors, (768), 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-04 06:17:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4079 transitions. [2025-03-04 06:17:37,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2025-03-04 06:17:37,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:37,208 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-04 06:17:37,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 06:17:37,408 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-04 06:17:37,409 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:37,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:37,410 INFO L85 PathProgramCache]: Analyzing trace with hash 73838019, now seen corresponding path program 2 times [2025-03-04 06:17:37,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:37,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605375180] [2025-03-04 06:17:37,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:17:37,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:37,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 827 statements into 2 equivalence classes. [2025-03-04 06:17:37,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 72 of 827 statements. [2025-03-04 06:17:37,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:17:37,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:37,824 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-04 06:17:37,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:37,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605375180] [2025-03-04 06:17:37,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605375180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:37,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:37,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:17:37,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833143605] [2025-03-04 06:17:37,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:37,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:17:37,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:37,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:17:37,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:17:37,827 INFO L87 Difference]: Start difference. First operand 2551 states and 4079 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-04 06:17:38,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:38,271 INFO L93 Difference]: Finished difference Result 3712 states and 6291 transitions. [2025-03-04 06:17:38,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:17:38,272 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-04 06:17:38,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:38,285 INFO L225 Difference]: With dead ends: 3712 [2025-03-04 06:17:38,285 INFO L226 Difference]: Without dead ends: 2591 [2025-03-04 06:17:38,290 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-04 06:17:38,291 INFO L435 NwaCegarLoop]: 2342 mSDtfsCounter, 80 mSDsluCounter, 9115 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 11457 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-04 06:17:38,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 11457 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:17:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-03-04 06:17:38,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2553. [2025-03-04 06:17:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2036 states have (on average 1.5014734774066798) internal successors, (3057), 2537 states have internal predecessors, (3057), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-04 06:17:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 4081 transitions. [2025-03-04 06:17:38,543 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 4081 transitions. Word has length 827 [2025-03-04 06:17:38,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:38,544 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 4081 transitions. [2025-03-04 06:17:38,544 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-04 06:17:38,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 4081 transitions. [2025-03-04 06:17:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-04 06:17:38,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:38,562 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-04 06:17:38,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:17:38,562 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:38,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:38,563 INFO L85 PathProgramCache]: Analyzing trace with hash -573182067, now seen corresponding path program 1 times [2025-03-04 06:17:38,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:38,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298072859] [2025-03-04 06:17:38,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:38,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:38,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-04 06:17:39,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-04 06:17:39,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:39,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:40,868 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-04 06:17:40,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:40,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298072859] [2025-03-04 06:17:40,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298072859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:40,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:40,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:17:40,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150415993] [2025-03-04 06:17:40,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:40,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:17:40,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:40,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:17:40,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:17:40,871 INFO L87 Difference]: Start difference. First operand 2553 states and 4081 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 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-04 06:17:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:41,251 INFO L93 Difference]: Finished difference Result 3681 states and 6247 transitions. [2025-03-04 06:17:41,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:17:41,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 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-04 06:17:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:41,263 INFO L225 Difference]: With dead ends: 3681 [2025-03-04 06:17:41,263 INFO L226 Difference]: Without dead ends: 2558 [2025-03-04 06:17:41,267 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-04 06:17:41,269 INFO L435 NwaCegarLoop]: 2322 mSDtfsCounter, 14 mSDsluCounter, 9020 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11342 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:41,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11342 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:17:41,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-03-04 06:17:41,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2557. [2025-03-04 06:17:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2040 states have (on average 1.5009803921568627) internal successors, (3062), 2541 states have internal predecessors, (3062), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-04 06:17:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4086 transitions. [2025-03-04 06:17:41,526 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4086 transitions. Word has length 828 [2025-03-04 06:17:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:41,528 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 4086 transitions. [2025-03-04 06:17:41,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 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-04 06:17:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4086 transitions. [2025-03-04 06:17:41,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-04 06:17:41,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:41,539 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-04 06:17:41,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:17:41,539 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:41,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:41,540 INFO L85 PathProgramCache]: Analyzing trace with hash 325287466, now seen corresponding path program 1 times [2025-03-04 06:17:41,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:41,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454513410] [2025-03-04 06:17:41,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:41,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:41,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-04 06:17:42,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-04 06:17:42,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:42,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:43,452 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-04 06:17:43,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:43,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454513410] [2025-03-04 06:17:43,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454513410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:43,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:43,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:17:43,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852577927] [2025-03-04 06:17:43,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:43,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:17:43,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:43,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:17:43,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:17:43,454 INFO L87 Difference]: Start difference. First operand 2557 states and 4086 transitions. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 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-04 06:17:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:43,865 INFO L93 Difference]: Finished difference Result 3695 states and 6266 transitions. [2025-03-04 06:17:43,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:17:43,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 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 829 [2025-03-04 06:17:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:43,874 INFO L225 Difference]: With dead ends: 3695 [2025-03-04 06:17:43,874 INFO L226 Difference]: Without dead ends: 2568 [2025-03-04 06:17:43,878 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-04 06:17:43,878 INFO L435 NwaCegarLoop]: 2323 mSDtfsCounter, 31 mSDsluCounter, 15885 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 18208 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:43,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 18208 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:17:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2025-03-04 06:17:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2565. [2025-03-04 06:17:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2048 states have (on average 1.49951171875) internal successors, (3071), 2549 states have internal predecessors, (3071), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-04 06:17:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 4095 transitions. [2025-03-04 06:17:44,033 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 4095 transitions. Word has length 829 [2025-03-04 06:17:44,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:44,034 INFO L471 AbstractCegarLoop]: Abstraction has 2565 states and 4095 transitions. [2025-03-04 06:17:44,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 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-04 06:17:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 4095 transitions. [2025-03-04 06:17:44,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2025-03-04 06:17:44,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:44,040 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, 1] [2025-03-04 06:17:44,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:17:44,040 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:44,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1493848262, now seen corresponding path program 1 times [2025-03-04 06:17:44,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:44,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537153617] [2025-03-04 06:17:44,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:44,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 830 statements into 1 equivalence classes. [2025-03-04 06:17:44,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 830 of 830 statements. [2025-03-04 06:17:44,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:44,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:17:52,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:52,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537153617] [2025-03-04 06:17:52,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537153617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:17:52,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249733381] [2025-03-04 06:17:52,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:52,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:17:52,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:17:52,288 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:17:52,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 06:17:52,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 830 statements into 1 equivalence classes. [2025-03-04 06:17:53,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 830 of 830 statements. [2025-03-04 06:17:53,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:53,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:53,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 4149 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 06:17:53,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:17:53,412 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-04 06:17:53,539 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-04 06:17:53,608 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-04 06:17:53,678 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-04 06:17:53,756 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-04 06:17:53,816 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-04 06:17:53,876 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-04 06:17:53,944 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-04 06:17:54,019 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-04 06:17:54,089 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-04 06:17:54,151 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-04 06:17:54,157 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-04 06:17:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:17:54,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:17:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:17:54,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249733381] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:17:54,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:17:54,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 14] total 38 [2025-03-04 06:17:54,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975408434] [2025-03-04 06:17:54,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:17:54,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 06:17:54,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:54,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 06:17:54,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=836, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 06:17:54,980 INFO L87 Difference]: Start difference. First operand 2565 states and 4095 transitions. Second operand has 38 states, 38 states have (on average 43.973684210526315) internal successors, (1671), 38 states have internal predecessors, (1671), 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-04 06:18:18,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:18,233 INFO L93 Difference]: Finished difference Result 19086 states and 34757 transitions. [2025-03-04 06:18:18,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-04 06:18:18,234 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 43.973684210526315) internal successors, (1671), 38 states have internal predecessors, (1671), 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 830 [2025-03-04 06:18:18,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:18,305 INFO L225 Difference]: With dead ends: 19086 [2025-03-04 06:18:18,305 INFO L226 Difference]: Without dead ends: 17950 [2025-03-04 06:18:18,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1700 GetRequests, 1649 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=871, Invalid=1579, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 06:18:18,314 INFO L435 NwaCegarLoop]: 1858 mSDtfsCounter, 36423 mSDsluCounter, 35478 mSDsCounter, 0 mSdLazyCounter, 19977 mSolverCounterSat, 4416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42445 SdHoareTripleChecker+Valid, 37336 SdHoareTripleChecker+Invalid, 24393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4416 IncrementalHoareTripleChecker+Valid, 19977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:18,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42445 Valid, 37336 Invalid, 24393 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4416 Valid, 19977 Invalid, 0 Unknown, 0 Unchecked, 19.9s Time] [2025-03-04 06:18:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17950 states. [2025-03-04 06:18:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17950 to 4257. [2025-03-04 06:18:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4257 states, 3728 states have (on average 1.4289163090128756) internal successors, (5327), 4229 states have internal predecessors, (5327), 524 states have call successors, (524), 3 states have call predecessors, (524), 3 states have return successors, (524), 25 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-04 06:18:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4257 states to 4257 states and 6375 transitions. [2025-03-04 06:18:20,002 INFO L78 Accepts]: Start accepts. Automaton has 4257 states and 6375 transitions. Word has length 830 [2025-03-04 06:18:20,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:20,003 INFO L471 AbstractCegarLoop]: Abstraction has 4257 states and 6375 transitions. [2025-03-04 06:18:20,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 43.973684210526315) internal successors, (1671), 38 states have internal predecessors, (1671), 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-04 06:18:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 4257 states and 6375 transitions. [2025-03-04 06:18:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1719 [2025-03-04 06:18:20,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:20,020 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-03-04 06:18:20,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 06:18:20,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:18:20,221 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:20,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:20,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1203097942, now seen corresponding path program 2 times [2025-03-04 06:18:20,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:20,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192713607] [2025-03-04 06:18:20,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:18:20,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:20,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1718 statements into 2 equivalence classes. [2025-03-04 06:18:20,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 75 of 1718 statements. [2025-03-04 06:18:20,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:18:20,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17100 trivial. 0 not checked. [2025-03-04 06:18:21,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:21,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192713607] [2025-03-04 06:18:21,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192713607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:21,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:21,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 06:18:21,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030474581] [2025-03-04 06:18:21,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:21,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 06:18:21,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:21,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 06:18:21,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-04 06:18:21,071 INFO L87 Difference]: Start difference. First operand 4257 states and 6375 transitions. Second operand has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 states have internal predecessors, (159), 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-04 06:18:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:21,979 INFO L93 Difference]: Finished difference Result 5428 states and 8604 transitions. [2025-03-04 06:18:21,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 06:18:21,979 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 states have internal predecessors, (159), 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 1718 [2025-03-04 06:18:21,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:21,992 INFO L225 Difference]: With dead ends: 5428 [2025-03-04 06:18:21,993 INFO L226 Difference]: Without dead ends: 4293 [2025-03-04 06:18:21,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-03-04 06:18:21,996 INFO L435 NwaCegarLoop]: 2285 mSDtfsCounter, 47 mSDsluCounter, 33846 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 36131 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:21,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 36131 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:18:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2025-03-04 06:18:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 4269. [2025-03-04 06:18:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4269 states, 3740 states have (on average 1.4288770053475937) internal successors, (5344), 4241 states have internal predecessors, (5344), 524 states have call successors, (524), 3 states have call predecessors, (524), 3 states have return successors, (524), 25 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-04 06:18:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4269 states to 4269 states and 6392 transitions. [2025-03-04 06:18:22,253 INFO L78 Accepts]: Start accepts. Automaton has 4269 states and 6392 transitions. Word has length 1718 [2025-03-04 06:18:22,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:22,255 INFO L471 AbstractCegarLoop]: Abstraction has 4269 states and 6392 transitions. [2025-03-04 06:18:22,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 states have internal predecessors, (159), 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-04 06:18:22,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4269 states and 6392 transitions. [2025-03-04 06:18:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1719 [2025-03-04 06:18:22,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:22,270 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-03-04 06:18:22,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:18:22,271 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:22,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:22,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1473836454, now seen corresponding path program 1 times [2025-03-04 06:18:22,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:22,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580737204] [2025-03-04 06:18:22,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:22,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:22,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1718 statements into 1 equivalence classes. [2025-03-04 06:18:23,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1718 of 1718 statements. [2025-03-04 06:18:23,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:23,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat