./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/memory-model/2SB.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/memory-model/2SB.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 cec14f16ae81e958645b6575cf97932d8a09e14a8eafa007b1475b8cf31c9f62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:45:57,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:45:57,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:45:57,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:45:57,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:45:57,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:45:57,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:45:57,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:45:57,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:45:57,340 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:45:57,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:45:57,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:45:57,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:45:57,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:45:57,341 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:45:57,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:45:57,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:45:57,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:45:57,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:45:57,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:45:57,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:45:57,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:45:57,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:45:57,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:45:57,342 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:45:57,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:45:57,343 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:45:57,343 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:45:57,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:45:57,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:45:57,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:45:57,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:45:57,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:45:57,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:45:57,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:45:57,344 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:45:57,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:45:57,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:45:57,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:45:57,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:45:57,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:45:57,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:45:57,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:45:57,344 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 -> cec14f16ae81e958645b6575cf97932d8a09e14a8eafa007b1475b8cf31c9f62 [2025-03-03 09:45:57,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:45:57,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:45:57,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:45:57,572 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:45:57,572 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:45:57,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memory-model/2SB.i [2025-03-03 09:45:58,666 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391197ae3/55eb707f70e5421d99803b43324bed7e/FLAGebc6348fe [2025-03-03 09:45:58,896 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:45:58,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memory-model/2SB.i [2025-03-03 09:45:58,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391197ae3/55eb707f70e5421d99803b43324bed7e/FLAGebc6348fe [2025-03-03 09:45:58,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391197ae3/55eb707f70e5421d99803b43324bed7e [2025-03-03 09:45:58,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:45:58,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:45:58,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:45:58,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:45:58,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:45:58,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:45:58" (1/1) ... [2025-03-03 09:45:58,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28828d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:58, skipping insertion in model container [2025-03-03 09:45:58,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:45:58" (1/1) ... [2025-03-03 09:45:58,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:45:59,142 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/memory-model/2SB.i[13547,13560] [2025-03-03 09:45:59,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:45:59,157 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:45:59,243 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/memory-model/2SB.i[13547,13560] [2025-03-03 09:45:59,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:45:59,256 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:45:59,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59 WrapperNode [2025-03-03 09:45:59,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:45:59,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:45:59,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:45:59,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:45:59,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 09:45:59,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 09:45:59,309 INFO L138 Inliner]: procedures = 27, calls = 414, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 913 [2025-03-03 09:45:59,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:45:59,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:45:59,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:45:59,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:45:59,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 09:45:59,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 09:45:59,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 09:45:59,362 INFO L175 MemorySlicer]: Split 310 memory accesses to 14 slices as follows [10, 10, 48, 76, 13, 3, 10, 40, 37, 15, 11, 13, 12, 12]. 25 percent of accesses are in the largest equivalence class. The 26 initializations are split as follows [1, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 5, 10, 5]. The 117 writes are split as follows [3, 5, 10, 40, 2, 2, 5, 20, 15, 5, 5, 2, 1, 2]. [2025-03-03 09:45:59,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 09:45:59,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 09:45:59,395 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 09:45:59,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 09:45:59,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 09:45:59,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 09:45:59,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:45:59,411 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:45:59,411 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:45:59,411 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:45:59,411 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 09:45:59,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:45:59,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:45:59,441 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-03 09:45:59,446 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-03 09:45:59,463 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_write [2025-03-03 09:45:59,464 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_write [2025-03-03 09:45:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_headerT [2025-03-03 09:45:59,464 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_nondet_headerT [2025-03-03 09:45:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure stepWriteBuffer [2025-03-03 09:45:59,464 INFO L138 BoogieDeclarations]: Found implementation of procedure stepWriteBuffer [2025-03-03 09:45:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_read [2025-03-03 09:45:59,464 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_read [2025-03-03 09:45:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:45:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:45:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:45:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:45:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 09:45:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 09:45:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 09:45:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 09:45:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 09:45:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 09:45:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 09:45:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 09:45:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure store_buffering_2_conditions [2025-03-03 09:45:59,465 INFO L138 BoogieDeclarations]: Found implementation of procedure store_buffering_2_conditions [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 09:45:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 09:45:59,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 09:45:59,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 09:45:59,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 09:45:59,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 09:45:59,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 09:45:59,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 09:45:59,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 09:45:59,467 INFO L130 BoogieDeclarations]: Found specification of procedure initWriteBuffer [2025-03-03 09:45:59,467 INFO L138 BoogieDeclarations]: Found implementation of procedure initWriteBuffer [2025-03-03 09:45:59,467 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_fence [2025-03-03 09:45:59,467 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_fence [2025-03-03 09:45:59,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:45:59,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:45:59,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:45:59,620 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:45:59,621 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:46:00,004 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc #t~mem7#1;havoc #t~mem8#1;havoc #t~mem9#1;havoc #t~mem10#1;havoc #t~mem11#1;call ULTIMATE.dealloc(~#result~0#1.base, ~#result~0#1.offset);havoc ~#result~0#1.base, ~#result~0#1.offset; [2025-03-03 09:46:00,004 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L50: havoc __VERIFIER_nondet_operations_#t~nondet1#1; [2025-03-03 09:46:00,325 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L47: havoc __VERIFIER_nondet_step_#t~nondet0#1; [2025-03-03 09:46:00,326 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L83: call ULTIMATE.dealloc(main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset);havoc main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset);havoc main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset);havoc main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset;call ULTIMATE.dealloc(main_~#g_history~0#1.base, main_~#g_history~0#1.offset);havoc main_~#g_history~0#1.base, main_~#g_history~0#1.offset;call ULTIMATE.dealloc(main_~#global_time~0#1.base, main_~#global_time~0#1.offset);havoc main_~#global_time~0#1.base, main_~#global_time~0#1.offset;call ULTIMATE.dealloc(main_~#litmus_input~0#1.base, main_~#litmus_input~0#1.offset);havoc main_~#litmus_input~0#1.base, main_~#litmus_input~0#1.offset;call ULTIMATE.dealloc(main_~#input_action~0#1.base, main_~#input_action~0#1.offset);havoc main_~#input_action~0#1.base, main_~#input_action~0#1.offset; [2025-03-03 09:46:00,386 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2025-03-03 09:46:00,387 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:46:00,398 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:46:00,400 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:46:00,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:46:00 BoogieIcfgContainer [2025-03-03 09:46:00,401 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:46:00,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:46:00,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:46:00,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:46:00,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:45:58" (1/3) ... [2025-03-03 09:46:00,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f20ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:46:00, skipping insertion in model container [2025-03-03 09:46:00,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (2/3) ... [2025-03-03 09:46:00,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f20ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:46:00, skipping insertion in model container [2025-03-03 09:46:00,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:46:00" (3/3) ... [2025-03-03 09:46:00,409 INFO L128 eAbstractionObserver]: Analyzing ICFG 2SB.i [2025-03-03 09:46:00,420 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:46:00,421 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 2SB.i that has 8 procedures, 166 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-03 09:46:00,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:46:00,473 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;@3e41d17f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:46:00,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:46:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 146 states have internal predecessors, (218), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:00,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 09:46:00,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:00,484 INFO L218 NwaCegarLoop]: trace histogram [2, 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] [2025-03-03 09:46:00,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:00,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:00,489 INFO L85 PathProgramCache]: Analyzing trace with hash 421490303, now seen corresponding path program 1 times [2025-03-03 09:46:00,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:00,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633756005] [2025-03-03 09:46:00,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:00,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:00,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 09:46:00,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 09:46:00,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:00,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 09:46:00,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:00,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633756005] [2025-03-03 09:46:00,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633756005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:00,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:46:00,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:46:00,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457564652] [2025-03-03 09:46:00,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:00,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:00,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:00,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:00,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:46:00,834 INFO L87 Difference]: Start difference. First operand has 166 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 146 states have internal predecessors, (218), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:00,864 INFO L93 Difference]: Finished difference Result 330 states and 490 transitions. [2025-03-03 09:46:00,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:00,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2025-03-03 09:46:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:00,870 INFO L225 Difference]: With dead ends: 330 [2025-03-03 09:46:00,870 INFO L226 Difference]: Without dead ends: 156 [2025-03-03 09:46:00,873 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-03 09:46:00,874 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:00,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 435 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-03 09:46:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-03 09:46:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.3059701492537314) internal successors, (175), 136 states have internal predecessors, (175), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 203 transitions. [2025-03-03 09:46:00,908 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 203 transitions. Word has length 42 [2025-03-03 09:46:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:00,908 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 203 transitions. [2025-03-03 09:46:00,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2025-03-03 09:46:00,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:46:00,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:00,911 INFO L218 NwaCegarLoop]: trace histogram [2, 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] [2025-03-03 09:46:00,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:46:00,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:00,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:00,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1503754085, now seen corresponding path program 1 times [2025-03-03 09:46:00,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:00,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832568389] [2025-03-03 09:46:00,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:00,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:00,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:46:00,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:46:00,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:00,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 09:46:01,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:01,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832568389] [2025-03-03 09:46:01,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832568389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:01,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278783215] [2025-03-03 09:46:01,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:01,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:01,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:01,104 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-03 09:46:01,106 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-03 09:46:01,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:46:01,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:46:01,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:01,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:01,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:46:01,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:46:01,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:01,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278783215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:01,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:01,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:01,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995013563] [2025-03-03 09:46:01,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:01,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:01,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:01,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:01,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:01,321 INFO L87 Difference]: Start difference. First operand 156 states and 203 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:46:01,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:01,336 INFO L93 Difference]: Finished difference Result 307 states and 402 transitions. [2025-03-03 09:46:01,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:01,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2025-03-03 09:46:01,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:01,338 INFO L225 Difference]: With dead ends: 307 [2025-03-03 09:46:01,338 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 09:46:01,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:01,339 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:01,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 400 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:01,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 09:46:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-03 09:46:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 135 states have (on average 1.3037037037037038) internal successors, (176), 137 states have internal predecessors, (176), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 204 transitions. [2025-03-03 09:46:01,347 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 204 transitions. Word has length 44 [2025-03-03 09:46:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:01,348 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 204 transitions. [2025-03-03 09:46:01,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:46:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 204 transitions. [2025-03-03 09:46:01,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 09:46:01,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:01,349 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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] [2025-03-03 09:46:01,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:01,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:01,553 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:01,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:01,553 INFO L85 PathProgramCache]: Analyzing trace with hash -302591869, now seen corresponding path program 1 times [2025-03-03 09:46:01,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:01,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410384208] [2025-03-03 09:46:01,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:01,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:01,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 09:46:01,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 09:46:01,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:01,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:01,683 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:46:01,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:01,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410384208] [2025-03-03 09:46:01,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410384208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:01,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908111541] [2025-03-03 09:46:01,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:01,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:01,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:01,686 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-03 09:46:01,687 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-03 09:46:01,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 09:46:01,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 09:46:01,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:01,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:01,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:46:01,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:46:01,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:01,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908111541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:01,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:01,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:01,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753313495] [2025-03-03 09:46:01,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:01,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:01,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:01,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:01,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:01,885 INFO L87 Difference]: Start difference. First operand 157 states and 204 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:46:01,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:01,919 INFO L93 Difference]: Finished difference Result 299 states and 389 transitions. [2025-03-03 09:46:01,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:01,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-03-03 09:46:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:01,922 INFO L225 Difference]: With dead ends: 299 [2025-03-03 09:46:01,922 INFO L226 Difference]: Without dead ends: 164 [2025-03-03 09:46:01,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:01,923 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 6 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:01,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 391 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-03 09:46:01,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2025-03-03 09:46:01,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 136 states have (on average 1.3014705882352942) internal successors, (177), 138 states have internal predecessors, (177), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:01,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 205 transitions. [2025-03-03 09:46:01,937 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 205 transitions. Word has length 46 [2025-03-03 09:46:01,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:01,937 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 205 transitions. [2025-03-03 09:46:01,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:46:01,937 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2025-03-03 09:46:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 09:46:01,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:01,939 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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] [2025-03-03 09:46:01,947 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-03 09:46:02,140 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,SelfDestructingSolverStorable2 [2025-03-03 09:46:02,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:02,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:02,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1940430982, now seen corresponding path program 1 times [2025-03-03 09:46:02,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:02,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122387853] [2025-03-03 09:46:02,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:02,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:02,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 09:46:02,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:46:02,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:02,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:46:02,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:02,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122387853] [2025-03-03 09:46:02,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122387853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:02,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682316124] [2025-03-03 09:46:02,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:02,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:02,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:02,246 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-03 09:46:02,248 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-03 09:46:02,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 09:46:02,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:46:02,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:02,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:02,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:46:02,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 09:46:02,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:02,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682316124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:02,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:02,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:02,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755110268] [2025-03-03 09:46:02,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:02,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:02,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:02,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:02,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:02,460 INFO L87 Difference]: Start difference. First operand 158 states and 205 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:46:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:02,486 INFO L93 Difference]: Finished difference Result 289 states and 377 transitions. [2025-03-03 09:46:02,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:02,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2025-03-03 09:46:02,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:02,488 INFO L225 Difference]: With dead ends: 289 [2025-03-03 09:46:02,488 INFO L226 Difference]: Without dead ends: 165 [2025-03-03 09:46:02,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:02,491 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 6 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:02,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 394 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:02,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-03 09:46:02,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 159. [2025-03-03 09:46:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 139 states have internal predecessors, (178), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 206 transitions. [2025-03-03 09:46:02,501 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 206 transitions. Word has length 49 [2025-03-03 09:46:02,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:02,501 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 206 transitions. [2025-03-03 09:46:02,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:46:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 206 transitions. [2025-03-03 09:46:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 09:46:02,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:02,504 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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] [2025-03-03 09:46:02,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:02,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:02,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:02,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:02,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1556905117, now seen corresponding path program 1 times [2025-03-03 09:46:02,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:02,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757664294] [2025-03-03 09:46:02,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:02,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:02,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 09:46:02,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 09:46:02,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:02,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:02,822 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:46:02,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:02,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757664294] [2025-03-03 09:46:02,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757664294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:02,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217302553] [2025-03-03 09:46:02,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:02,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:02,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:02,826 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:02,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:46:02,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 09:46:03,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 09:46:03,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:03,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:03,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:46:03,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:46:03,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:03,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217302553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:03,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:03,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:03,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766178644] [2025-03-03 09:46:03,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:03,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:03,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:03,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:03,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:03,029 INFO L87 Difference]: Start difference. First operand 159 states and 206 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:03,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:03,087 INFO L93 Difference]: Finished difference Result 194 states and 260 transitions. [2025-03-03 09:46:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:03,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2025-03-03 09:46:03,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:03,090 INFO L225 Difference]: With dead ends: 194 [2025-03-03 09:46:03,090 INFO L226 Difference]: Without dead ends: 189 [2025-03-03 09:46:03,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:03,091 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 47 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:03,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 356 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:46:03,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-03 09:46:03,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 160. [2025-03-03 09:46:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 138 states have (on average 1.2971014492753623) internal successors, (179), 140 states have internal predecessors, (179), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 207 transitions. [2025-03-03 09:46:03,104 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 207 transitions. Word has length 52 [2025-03-03 09:46:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:03,104 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 207 transitions. [2025-03-03 09:46:03,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 207 transitions. [2025-03-03 09:46:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 09:46:03,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:03,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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] [2025-03-03 09:46:03,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:03,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:03,311 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:03,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:03,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1580598961, now seen corresponding path program 1 times [2025-03-03 09:46:03,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:03,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804764606] [2025-03-03 09:46:03,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:03,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:03,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 09:46:03,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 09:46:03,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:03,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:46:03,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:03,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804764606] [2025-03-03 09:46:03,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804764606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:03,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058316643] [2025-03-03 09:46:03,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:03,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:03,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:03,421 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:03,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:46:03,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 09:46:03,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 09:46:03,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:03,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:03,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:03,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:46:03,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:03,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058316643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:03,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:03,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 09:46:03,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596489977] [2025-03-03 09:46:03,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:03,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:46:03,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:03,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:46:03,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:03,636 INFO L87 Difference]: Start difference. First operand 160 states and 207 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:03,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:03,654 INFO L93 Difference]: Finished difference Result 198 states and 265 transitions. [2025-03-03 09:46:03,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:46:03,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2025-03-03 09:46:03,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:03,655 INFO L225 Difference]: With dead ends: 198 [2025-03-03 09:46:03,655 INFO L226 Difference]: Without dead ends: 163 [2025-03-03 09:46:03,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:03,656 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:03,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 587 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:03,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-03 09:46:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2025-03-03 09:46:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.292857142857143) internal successors, (181), 142 states have internal predecessors, (181), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 209 transitions. [2025-03-03 09:46:03,661 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 209 transitions. Word has length 62 [2025-03-03 09:46:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:03,662 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 209 transitions. [2025-03-03 09:46:03,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:03,662 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 209 transitions. [2025-03-03 09:46:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 09:46:03,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:03,663 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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] [2025-03-03 09:46:03,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:03,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:03,867 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:03,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:03,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1777112466, now seen corresponding path program 1 times [2025-03-03 09:46:03,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:03,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016839049] [2025-03-03 09:46:03,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:03,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:03,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 09:46:03,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 09:46:03,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:03,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:03,960 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:46:03,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:03,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016839049] [2025-03-03 09:46:03,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016839049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:03,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729749079] [2025-03-03 09:46:03,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:03,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:03,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:03,963 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:03,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:46:04,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 09:46:04,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 09:46:04,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:04,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:04,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:04,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:46:04,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:04,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729749079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:04,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:04,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 09:46:04,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965075818] [2025-03-03 09:46:04,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:04,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:46:04,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:04,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:46:04,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:04,185 INFO L87 Difference]: Start difference. First operand 162 states and 209 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:04,203 INFO L93 Difference]: Finished difference Result 202 states and 270 transitions. [2025-03-03 09:46:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:46:04,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2025-03-03 09:46:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:04,205 INFO L225 Difference]: With dead ends: 202 [2025-03-03 09:46:04,205 INFO L226 Difference]: Without dead ends: 165 [2025-03-03 09:46:04,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:04,206 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:04,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 589 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:04,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-03 09:46:04,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-03 09:46:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 143 states have (on average 1.2867132867132867) internal successors, (184), 145 states have internal predecessors, (184), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2025-03-03 09:46:04,210 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 62 [2025-03-03 09:46:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:04,211 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2025-03-03 09:46:04,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2025-03-03 09:46:04,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 09:46:04,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:04,212 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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] [2025-03-03 09:46:04,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:04,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:04,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:04,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:04,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1709681680, now seen corresponding path program 1 times [2025-03-03 09:46:04,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:04,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33858221] [2025-03-03 09:46:04,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:04,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:04,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 09:46:04,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 09:46:04,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:04,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:46:04,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:04,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33858221] [2025-03-03 09:46:04,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33858221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:04,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037920339] [2025-03-03 09:46:04,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:04,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:04,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:04,502 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:04,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:46:04,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 09:46:04,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 09:46:04,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:04,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:04,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:04,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:46:04,741 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:04,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037920339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:04,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:04,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:04,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556114008] [2025-03-03 09:46:04,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:04,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:04,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:04,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:04,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:04,742 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:04,752 INFO L93 Difference]: Finished difference Result 205 states and 271 transitions. [2025-03-03 09:46:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:04,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2025-03-03 09:46:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:04,754 INFO L225 Difference]: With dead ends: 205 [2025-03-03 09:46:04,754 INFO L226 Difference]: Without dead ends: 200 [2025-03-03 09:46:04,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:04,755 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 37 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:04,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 398 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:04,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-03 09:46:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2025-03-03 09:46:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 177 states have (on average 1.3333333333333333) internal successors, (236), 179 states have internal predecessors, (236), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 264 transitions. [2025-03-03 09:46:04,761 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 264 transitions. Word has length 62 [2025-03-03 09:46:04,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:04,761 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 264 transitions. [2025-03-03 09:46:04,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 264 transitions. [2025-03-03 09:46:04,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 09:46:04,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:04,762 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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] [2025-03-03 09:46:04,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:04,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:04,963 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:04,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:04,963 INFO L85 PathProgramCache]: Analyzing trace with hash -124453687, now seen corresponding path program 1 times [2025-03-03 09:46:04,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:04,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82225937] [2025-03-03 09:46:04,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:04,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:04,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 09:46:04,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 09:46:04,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:04,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:46:05,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:05,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82225937] [2025-03-03 09:46:05,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82225937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:05,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568175803] [2025-03-03 09:46:05,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:05,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:05,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:05,071 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:05,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:46:05,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 09:46:05,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 09:46:05,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:05,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:05,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:05,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:46:05,312 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:05,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568175803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:05,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:05,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 09:46:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101044369] [2025-03-03 09:46:05,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:05,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:46:05,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:05,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:46:05,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:05,314 INFO L87 Difference]: Start difference. First operand 199 states and 264 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:05,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:05,338 INFO L93 Difference]: Finished difference Result 280 states and 386 transitions. [2025-03-03 09:46:05,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:46:05,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2025-03-03 09:46:05,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:05,340 INFO L225 Difference]: With dead ends: 280 [2025-03-03 09:46:05,341 INFO L226 Difference]: Without dead ends: 205 [2025-03-03 09:46:05,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:05,342 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:05,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 589 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:05,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-03 09:46:05,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-03-03 09:46:05,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 183 states have (on average 1.3224043715846994) internal successors, (242), 185 states have internal predecessors, (242), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 270 transitions. [2025-03-03 09:46:05,348 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 270 transitions. Word has length 68 [2025-03-03 09:46:05,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:05,348 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 270 transitions. [2025-03-03 09:46:05,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:05,348 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 270 transitions. [2025-03-03 09:46:05,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 09:46:05,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:05,349 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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] [2025-03-03 09:46:05,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 09:46:05,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 09:46:05,550 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:05,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:05,550 INFO L85 PathProgramCache]: Analyzing trace with hash 72059818, now seen corresponding path program 1 times [2025-03-03 09:46:05,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:05,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571202801] [2025-03-03 09:46:05,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:05,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:05,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 09:46:05,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 09:46:05,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:05,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:05,651 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:46:05,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:05,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571202801] [2025-03-03 09:46:05,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571202801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:05,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360099108] [2025-03-03 09:46:05,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:05,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:05,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:05,654 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:05,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:46:05,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 09:46:05,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 09:46:05,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:05,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:05,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:05,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:46:05,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:05,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360099108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:05,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:05,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:05,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593028526] [2025-03-03 09:46:05,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:05,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:05,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:05,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:05,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:05,949 INFO L87 Difference]: Start difference. First operand 205 states and 270 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:05,963 INFO L93 Difference]: Finished difference Result 286 states and 388 transitions. [2025-03-03 09:46:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:05,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2025-03-03 09:46:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:05,965 INFO L225 Difference]: With dead ends: 286 [2025-03-03 09:46:05,967 INFO L226 Difference]: Without dead ends: 281 [2025-03-03 09:46:05,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:05,967 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 31 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:05,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 399 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:05,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-03 09:46:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-03-03 09:46:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 259 states have (on average 1.3667953667953667) internal successors, (354), 261 states have internal predecessors, (354), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 382 transitions. [2025-03-03 09:46:05,974 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 382 transitions. Word has length 68 [2025-03-03 09:46:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:05,974 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 382 transitions. [2025-03-03 09:46:05,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 382 transitions. [2025-03-03 09:46:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 09:46:05,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:05,975 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:05,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 09:46:06,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 09:46:06,176 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:06,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:06,176 INFO L85 PathProgramCache]: Analyzing trace with hash 619558589, now seen corresponding path program 1 times [2025-03-03 09:46:06,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:06,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335610968] [2025-03-03 09:46:06,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:06,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:06,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 09:46:06,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 09:46:06,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:06,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 09:46:06,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:06,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335610968] [2025-03-03 09:46:06,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335610968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:06,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842503904] [2025-03-03 09:46:06,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:06,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:06,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:06,268 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:06,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:46:06,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 09:46:06,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 09:46:06,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:06,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:06,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:06,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:46:06,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:06,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842503904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:06,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:06,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:06,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182158818] [2025-03-03 09:46:06,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:06,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:06,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:06,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:06,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:06,521 INFO L87 Difference]: Start difference. First operand 281 states and 382 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:06,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:06,533 INFO L93 Difference]: Finished difference Result 438 states and 612 transitions. [2025-03-03 09:46:06,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:06,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 78 [2025-03-03 09:46:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:06,535 INFO L225 Difference]: With dead ends: 438 [2025-03-03 09:46:06,535 INFO L226 Difference]: Without dead ends: 433 [2025-03-03 09:46:06,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:06,536 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 27 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:06,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 398 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:06,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-03 09:46:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2025-03-03 09:46:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 411 states have (on average 1.4063260340632604) internal successors, (578), 413 states have internal predecessors, (578), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 606 transitions. [2025-03-03 09:46:06,549 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 606 transitions. Word has length 78 [2025-03-03 09:46:06,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:06,549 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 606 transitions. [2025-03-03 09:46:06,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:06,549 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 606 transitions. [2025-03-03 09:46:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 09:46:06,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:06,552 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:06,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:06,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 09:46:06,753 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:06,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:06,754 INFO L85 PathProgramCache]: Analyzing trace with hash 931313699, now seen corresponding path program 1 times [2025-03-03 09:46:06,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:06,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481660208] [2025-03-03 09:46:06,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:06,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:06,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 09:46:06,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 09:46:06,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:06,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 09:46:06,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:06,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481660208] [2025-03-03 09:46:06,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481660208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:06,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69238197] [2025-03-03 09:46:06,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:06,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:06,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:06,848 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:06,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:46:07,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 09:46:07,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 09:46:07,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:07,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:07,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:07,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:07,099 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 09:46:07,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:07,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69238197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:07,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:07,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 09:46:07,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823938220] [2025-03-03 09:46:07,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:07,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:46:07,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:07,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:46:07,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:07,101 INFO L87 Difference]: Start difference. First operand 433 states and 606 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:07,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:07,119 INFO L93 Difference]: Finished difference Result 766 states and 1100 transitions. [2025-03-03 09:46:07,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:46:07,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 102 [2025-03-03 09:46:07,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:07,123 INFO L225 Difference]: With dead ends: 766 [2025-03-03 09:46:07,123 INFO L226 Difference]: Without dead ends: 457 [2025-03-03 09:46:07,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:07,124 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:07,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 589 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-03 09:46:07,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2025-03-03 09:46:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 435 states have (on average 1.3839080459770114) internal successors, (602), 437 states have internal predecessors, (602), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 630 transitions. [2025-03-03 09:46:07,144 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 630 transitions. Word has length 102 [2025-03-03 09:46:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:07,144 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 630 transitions. [2025-03-03 09:46:07,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 630 transitions. [2025-03-03 09:46:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 09:46:07,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:07,147 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:07,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 09:46:07,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:46:07,348 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:07,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:07,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1018986556, now seen corresponding path program 1 times [2025-03-03 09:46:07,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:07,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949149971] [2025-03-03 09:46:07,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:07,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:07,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 09:46:07,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 09:46:07,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:07,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 09:46:07,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:07,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949149971] [2025-03-03 09:46:07,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949149971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:07,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941682671] [2025-03-03 09:46:07,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:07,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:07,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:07,434 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:07,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:46:07,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 09:46:07,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 09:46:07,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:07,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:07,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:07,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:46:07,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:07,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941682671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:07,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:07,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:07,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291754315] [2025-03-03 09:46:07,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:07,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:07,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:07,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:07,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:07,750 INFO L87 Difference]: Start difference. First operand 457 states and 630 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:07,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:07,765 INFO L93 Difference]: Finished difference Result 790 states and 1108 transitions. [2025-03-03 09:46:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:07,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 102 [2025-03-03 09:46:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:07,768 INFO L225 Difference]: With dead ends: 790 [2025-03-03 09:46:07,768 INFO L226 Difference]: Without dead ends: 785 [2025-03-03 09:46:07,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:07,769 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 16 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:07,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 397 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:07,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2025-03-03 09:46:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2025-03-03 09:46:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 763 states have (on average 1.4076015727391875) internal successors, (1074), 765 states have internal predecessors, (1074), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1102 transitions. [2025-03-03 09:46:07,788 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1102 transitions. Word has length 102 [2025-03-03 09:46:07,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:07,788 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1102 transitions. [2025-03-03 09:46:07,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:07,789 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1102 transitions. [2025-03-03 09:46:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 09:46:07,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:07,792 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:07,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:07,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:46:07,993 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:07,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:07,993 INFO L85 PathProgramCache]: Analyzing trace with hash -232029466, now seen corresponding path program 1 times [2025-03-03 09:46:07,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:07,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478062942] [2025-03-03 09:46:07,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:07,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:08,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 09:46:08,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 09:46:08,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:08,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:08,102 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 09:46:08,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:08,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478062942] [2025-03-03 09:46:08,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478062942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:08,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152209539] [2025-03-03 09:46:08,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:08,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:08,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:08,105 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:08,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:46:08,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 09:46:08,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 09:46:08,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:08,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:08,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:46:08,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-03 09:46:08,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:08,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152209539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:08,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:08,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:08,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061011696] [2025-03-03 09:46:08,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:08,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:08,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:08,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:08,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:08,393 INFO L87 Difference]: Start difference. First operand 785 states and 1102 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:08,406 INFO L93 Difference]: Finished difference Result 1134 states and 1612 transitions. [2025-03-03 09:46:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:08,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 132 [2025-03-03 09:46:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:08,409 INFO L225 Difference]: With dead ends: 1134 [2025-03-03 09:46:08,410 INFO L226 Difference]: Without dead ends: 801 [2025-03-03 09:46:08,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:08,411 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:08,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-03-03 09:46:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2025-03-03 09:46:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 779 states have (on average 1.399229781771502) internal successors, (1090), 781 states have internal predecessors, (1090), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1118 transitions. [2025-03-03 09:46:08,425 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1118 transitions. Word has length 132 [2025-03-03 09:46:08,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:08,425 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1118 transitions. [2025-03-03 09:46:08,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:46:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1118 transitions. [2025-03-03 09:46:08,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 09:46:08,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:08,427 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:08,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 09:46:08,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 09:46:08,628 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:08,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:08,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1698589639, now seen corresponding path program 1 times [2025-03-03 09:46:08,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:08,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142575807] [2025-03-03 09:46:08,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:08,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:08,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 09:46:08,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 09:46:08,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:08,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 09:46:08,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:08,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142575807] [2025-03-03 09:46:08,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142575807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:08,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287260441] [2025-03-03 09:46:08,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:08,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:08,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:08,733 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:08,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 09:46:08,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 09:46:09,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 09:46:09,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:09,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:09,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:09,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 09:46:09,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:46:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 09:46:09,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287260441] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:46:09,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:46:09,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 09:46:09,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305889710] [2025-03-03 09:46:09,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:46:09,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:46:09,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:09,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:46:09,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:46:09,076 INFO L87 Difference]: Start difference. First operand 801 states and 1118 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 1 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:46:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:09,101 INFO L93 Difference]: Finished difference Result 1601 states and 2237 transitions. [2025-03-03 09:46:09,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:46:09,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 1 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 132 [2025-03-03 09:46:09,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:09,104 INFO L225 Difference]: With dead ends: 1601 [2025-03-03 09:46:09,104 INFO L226 Difference]: Without dead ends: 804 [2025-03-03 09:46:09,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:46:09,108 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:09,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 597 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-03 09:46:09,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2025-03-03 09:46:09,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 782 states have (on average 1.39769820971867) internal successors, (1093), 784 states have internal predecessors, (1093), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1121 transitions. [2025-03-03 09:46:09,125 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1121 transitions. Word has length 132 [2025-03-03 09:46:09,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:09,125 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1121 transitions. [2025-03-03 09:46:09,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 1 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:46:09,125 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1121 transitions. [2025-03-03 09:46:09,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 09:46:09,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:09,128 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:09,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:09,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:09,329 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:09,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:09,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1556904485, now seen corresponding path program 2 times [2025-03-03 09:46:09,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:09,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985579622] [2025-03-03 09:46:09,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:46:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:09,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-03-03 09:46:09,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 09:46:09,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:46:09,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-03 09:46:09,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:09,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985579622] [2025-03-03 09:46:09,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985579622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:09,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135868655] [2025-03-03 09:46:09,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:46:09,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:09,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:09,478 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:09,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 09:46:09,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-03-03 09:46:10,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 09:46:10,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:46:10,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:10,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:46:10,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 09:46:10,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:46:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 09:46:10,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135868655] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:46:10,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:46:10,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 13 [2025-03-03 09:46:10,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416138261] [2025-03-03 09:46:10,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:46:10,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:46:10,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:10,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:46:10,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:46:10,121 INFO L87 Difference]: Start difference. First operand 804 states and 1121 transitions. Second operand has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:46:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:10,156 INFO L93 Difference]: Finished difference Result 1607 states and 2248 transitions. [2025-03-03 09:46:10,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:46:10,157 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 135 [2025-03-03 09:46:10,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:10,160 INFO L225 Difference]: With dead ends: 1607 [2025-03-03 09:46:10,160 INFO L226 Difference]: Without dead ends: 810 [2025-03-03 09:46:10,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:46:10,162 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:10,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1186 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:10,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-03-03 09:46:10,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 810. [2025-03-03 09:46:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 788 states have (on average 1.3946700507614214) internal successors, (1099), 790 states have internal predecessors, (1099), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:46:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1127 transitions. [2025-03-03 09:46:10,177 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1127 transitions. Word has length 135 [2025-03-03 09:46:10,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:10,177 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1127 transitions. [2025-03-03 09:46:10,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:46:10,177 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1127 transitions. [2025-03-03 09:46:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 09:46:10,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:10,179 INFO L218 NwaCegarLoop]: trace histogram [9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:10,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:10,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 09:46:10,380 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:10,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:10,380 INFO L85 PathProgramCache]: Analyzing trace with hash 142351081, now seen corresponding path program 3 times [2025-03-03 09:46:10,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:10,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933673483] [2025-03-03 09:46:10,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:46:10,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:10,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 142 statements into 6 equivalence classes. [2025-03-03 09:46:10,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 57 of 142 statements. [2025-03-03 09:46:10,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:46:10,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-03 09:46:10,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:10,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933673483] [2025-03-03 09:46:10,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933673483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:10,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:46:10,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 09:46:10,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554568548] [2025-03-03 09:46:10,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:10,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:46:10,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:10,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:46:10,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:46:10,807 INFO L87 Difference]: Start difference. First operand 810 states and 1127 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:46:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:11,780 INFO L93 Difference]: Finished difference Result 1565 states and 2195 transitions. [2025-03-03 09:46:11,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:46:11,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 142 [2025-03-03 09:46:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:11,784 INFO L225 Difference]: With dead ends: 1565 [2025-03-03 09:46:11,784 INFO L226 Difference]: Without dead ends: 881 [2025-03-03 09:46:11,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:46:11,786 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 183 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:11,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 910 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:46:11,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-03 09:46:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 851. [2025-03-03 09:46:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 823 states have (on average 1.3876063183475091) internal successors, (1142), 827 states have internal predecessors, (1142), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 09:46:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1182 transitions. [2025-03-03 09:46:11,804 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1182 transitions. Word has length 142 [2025-03-03 09:46:11,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:11,806 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1182 transitions. [2025-03-03 09:46:11,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:46:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1182 transitions. [2025-03-03 09:46:11,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 09:46:11,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:11,808 INFO L218 NwaCegarLoop]: trace histogram [9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:11,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 09:46:11,808 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:11,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1268249460, now seen corresponding path program 1 times [2025-03-03 09:46:11,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:11,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393880518] [2025-03-03 09:46:11,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:11,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:11,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 09:46:11,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 09:46:11,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:11,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-03 09:46:11,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:11,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393880518] [2025-03-03 09:46:11,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393880518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:11,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130875619] [2025-03-03 09:46:11,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:11,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:11,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:11,974 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:11,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 09:46:12,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 09:46:12,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 09:46:12,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:12,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:12,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:12,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:12,350 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-03 09:46:12,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:46:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-03 09:46:12,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130875619] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:46:12,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:46:12,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 09:46:12,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929101696] [2025-03-03 09:46:12,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:46:12,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:46:12,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:12,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:46:12,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:46:12,386 INFO L87 Difference]: Start difference. First operand 851 states and 1182 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 09:46:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:12,441 INFO L93 Difference]: Finished difference Result 1691 states and 2355 transitions. [2025-03-03 09:46:12,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:46:12,441 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 160 [2025-03-03 09:46:12,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:12,444 INFO L225 Difference]: With dead ends: 1691 [2025-03-03 09:46:12,444 INFO L226 Difference]: Without dead ends: 872 [2025-03-03 09:46:12,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:46:12,446 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 32 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:12,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 587 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-03 09:46:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-03 09:46:12,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 841 states have (on average 1.3828775267538644) internal successors, (1163), 845 states have internal predecessors, (1163), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 09:46:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1209 transitions. [2025-03-03 09:46:12,464 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1209 transitions. Word has length 160 [2025-03-03 09:46:12,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:12,465 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1209 transitions. [2025-03-03 09:46:12,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 09:46:12,465 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1209 transitions. [2025-03-03 09:46:12,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 09:46:12,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:12,467 INFO L218 NwaCegarLoop]: trace histogram [9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:12,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:12,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 09:46:12,668 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:12,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:12,668 INFO L85 PathProgramCache]: Analyzing trace with hash -655467437, now seen corresponding path program 2 times [2025-03-03 09:46:12,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:12,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625149999] [2025-03-03 09:46:12,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:46:12,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:12,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 169 statements into 2 equivalence classes. [2025-03-03 09:46:12,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 09:46:12,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:46:12,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 09:46:12,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:12,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625149999] [2025-03-03 09:46:12,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625149999] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:12,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138549472] [2025-03-03 09:46:12,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:46:12,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:12,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:12,841 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:12,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 09:46:13,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 169 statements into 2 equivalence classes. [2025-03-03 09:46:13,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 09:46:13,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:46:13,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:13,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:46:13,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-03 09:46:13,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:46:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-03 09:46:13,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138549472] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:46:13,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:46:13,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 13 [2025-03-03 09:46:13,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609796515] [2025-03-03 09:46:13,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:46:13,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:46:13,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:13,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:46:13,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:46:13,571 INFO L87 Difference]: Start difference. First operand 872 states and 1209 transitions. Second operand has 13 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 09:46:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:13,729 INFO L93 Difference]: Finished difference Result 1739 states and 2420 transitions. [2025-03-03 09:46:13,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:46:13,730 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 169 [2025-03-03 09:46:13,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:13,733 INFO L225 Difference]: With dead ends: 1739 [2025-03-03 09:46:13,733 INFO L226 Difference]: Without dead ends: 920 [2025-03-03 09:46:13,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:46:13,734 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 58 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:13,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1177 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:46:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-03-03 09:46:13,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 914. [2025-03-03 09:46:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 877 states have (on average 1.3740022805017105) internal successors, (1205), 881 states have internal predecessors, (1205), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 09:46:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1263 transitions. [2025-03-03 09:46:13,750 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1263 transitions. Word has length 169 [2025-03-03 09:46:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:13,750 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1263 transitions. [2025-03-03 09:46:13,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 09:46:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1263 transitions. [2025-03-03 09:46:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 09:46:13,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:13,752 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:13,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:13,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:13,958 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:13,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:13,958 INFO L85 PathProgramCache]: Analyzing trace with hash 976241337, now seen corresponding path program 3 times [2025-03-03 09:46:13,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:13,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165214968] [2025-03-03 09:46:13,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:46:13,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:14,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 187 statements into 11 equivalence classes. [2025-03-03 09:46:14,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 75 of 187 statements. [2025-03-03 09:46:14,063 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:46:14,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2025-03-03 09:46:14,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:14,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165214968] [2025-03-03 09:46:14,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165214968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:14,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611842676] [2025-03-03 09:46:14,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:46:14,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:14,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:14,685 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:14,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 09:46:14,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 187 statements into 11 equivalence classes. [2025-03-03 09:46:15,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 75 of 187 statements. [2025-03-03 09:46:15,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:46:15,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:15,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 09:46:15,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:15,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 152 [2025-03-03 09:46:16,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:46:16,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 153 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 135 treesize of output 171 [2025-03-03 09:46:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2025-03-03 09:46:17,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:17,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611842676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:17,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:17,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2025-03-03 09:46:17,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055291810] [2025-03-03 09:46:17,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:17,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:46:17,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:17,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:46:17,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:46:17,011 INFO L87 Difference]: Start difference. First operand 914 states and 1263 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 09:46:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:18,827 INFO L93 Difference]: Finished difference Result 2572 states and 3585 transitions. [2025-03-03 09:46:18,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:46:18,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 187 [2025-03-03 09:46:18,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:18,833 INFO L225 Difference]: With dead ends: 2572 [2025-03-03 09:46:18,833 INFO L226 Difference]: Without dead ends: 1888 [2025-03-03 09:46:18,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:46:18,835 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 202 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:18,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1512 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 09:46:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2025-03-03 09:46:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1115. [2025-03-03 09:46:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1043 states have (on average 1.3595397890699905) internal successors, (1418), 1071 states have internal predecessors, (1418), 59 states have call successors, (59), 12 states have call predecessors, (59), 12 states have return successors, (59), 37 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 09:46:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1536 transitions. [2025-03-03 09:46:18,874 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1536 transitions. Word has length 187 [2025-03-03 09:46:18,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:18,874 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1536 transitions. [2025-03-03 09:46:18,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 09:46:18,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1536 transitions. [2025-03-03 09:46:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 09:46:18,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:18,877 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:18,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-03 09:46:19,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:19,079 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:19,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:19,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1577594750, now seen corresponding path program 1 times [2025-03-03 09:46:19,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:19,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880027171] [2025-03-03 09:46:19,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:19,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:19,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 09:46:19,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 09:46:19,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:19,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:19,367 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-03 09:46:19,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:19,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880027171] [2025-03-03 09:46:19,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880027171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:19,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:46:19,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:46:19,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398564978] [2025-03-03 09:46:19,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:19,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:46:19,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:19,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:46:19,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:19,369 INFO L87 Difference]: Start difference. First operand 1115 states and 1536 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:19,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:19,468 INFO L93 Difference]: Finished difference Result 2448 states and 3430 transitions. [2025-03-03 09:46:19,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:46:19,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 203 [2025-03-03 09:46:19,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:19,474 INFO L225 Difference]: With dead ends: 2448 [2025-03-03 09:46:19,474 INFO L226 Difference]: Without dead ends: 1771 [2025-03-03 09:46:19,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:19,475 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 76 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:19,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 523 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:46:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2025-03-03 09:46:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1323. [2025-03-03 09:46:19,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 1251 states have (on average 1.3509192645883292) internal successors, (1690), 1279 states have internal predecessors, (1690), 59 states have call successors, (59), 12 states have call predecessors, (59), 12 states have return successors, (59), 37 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 09:46:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1808 transitions. [2025-03-03 09:46:19,510 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1808 transitions. Word has length 203 [2025-03-03 09:46:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:19,510 INFO L471 AbstractCegarLoop]: Abstraction has 1323 states and 1808 transitions. [2025-03-03 09:46:19,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1808 transitions. [2025-03-03 09:46:19,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 09:46:19,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:19,513 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:19,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 09:46:19,513 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:19,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:19,514 INFO L85 PathProgramCache]: Analyzing trace with hash -534993637, now seen corresponding path program 1 times [2025-03-03 09:46:19,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:19,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933209507] [2025-03-03 09:46:19,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:19,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:19,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 09:46:19,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 09:46:19,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:19,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-03-03 09:46:19,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:19,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933209507] [2025-03-03 09:46:19,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933209507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:19,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:46:19,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:46:19,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561419801] [2025-03-03 09:46:19,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:19,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:46:19,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:19,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:46:19,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:46:19,677 INFO L87 Difference]: Start difference. First operand 1323 states and 1808 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:19,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:19,715 INFO L93 Difference]: Finished difference Result 2240 states and 3094 transitions. [2025-03-03 09:46:19,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:46:19,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 203 [2025-03-03 09:46:19,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:19,719 INFO L225 Difference]: With dead ends: 2240 [2025-03-03 09:46:19,719 INFO L226 Difference]: Without dead ends: 1355 [2025-03-03 09:46:19,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:46:19,722 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:19,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 587 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2025-03-03 09:46:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1355. [2025-03-03 09:46:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1283 states have (on average 1.3421667965705377) internal successors, (1722), 1311 states have internal predecessors, (1722), 59 states have call successors, (59), 12 states have call predecessors, (59), 12 states have return successors, (59), 37 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 09:46:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1840 transitions. [2025-03-03 09:46:19,759 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1840 transitions. Word has length 203 [2025-03-03 09:46:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:19,759 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 1840 transitions. [2025-03-03 09:46:19,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1840 transitions. [2025-03-03 09:46:19,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 09:46:19,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:19,763 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:19,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 09:46:19,763 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:19,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:19,763 INFO L85 PathProgramCache]: Analyzing trace with hash 946300699, now seen corresponding path program 1 times [2025-03-03 09:46:19,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:19,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766485437] [2025-03-03 09:46:19,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:19,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:19,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 09:46:19,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 09:46:19,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:19,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 09:46:20,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:20,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766485437] [2025-03-03 09:46:20,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766485437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:20,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:46:20,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:46:20,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949716413] [2025-03-03 09:46:20,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:20,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:46:20,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:20,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:46:20,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:20,028 INFO L87 Difference]: Start difference. First operand 1355 states and 1840 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:20,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:20,135 INFO L93 Difference]: Finished difference Result 2640 states and 3622 transitions. [2025-03-03 09:46:20,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:46:20,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 203 [2025-03-03 09:46:20,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:20,141 INFO L225 Difference]: With dead ends: 2640 [2025-03-03 09:46:20,141 INFO L226 Difference]: Without dead ends: 1723 [2025-03-03 09:46:20,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:20,143 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 31 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:20,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 542 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:46:20,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2025-03-03 09:46:20,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1595. [2025-03-03 09:46:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1523 states have (on average 1.340774786605384) internal successors, (2042), 1551 states have internal predecessors, (2042), 59 states have call successors, (59), 12 states have call predecessors, (59), 12 states have return successors, (59), 37 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 09:46:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2160 transitions. [2025-03-03 09:46:20,183 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2160 transitions. Word has length 203 [2025-03-03 09:46:20,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:20,183 INFO L471 AbstractCegarLoop]: Abstraction has 1595 states and 2160 transitions. [2025-03-03 09:46:20,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2160 transitions. [2025-03-03 09:46:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 09:46:20,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:20,186 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:20,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 09:46:20,186 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:20,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:20,187 INFO L85 PathProgramCache]: Analyzing trace with hash -861546822, now seen corresponding path program 1 times [2025-03-03 09:46:20,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:20,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625121638] [2025-03-03 09:46:20,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:20,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:20,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 09:46:20,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 09:46:20,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:20,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 09:46:20,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:20,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625121638] [2025-03-03 09:46:20,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625121638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:20,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:46:20,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:46:20,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271830499] [2025-03-03 09:46:20,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:20,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:46:20,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:20,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:46:20,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:46:20,334 INFO L87 Difference]: Start difference. First operand 1595 states and 2160 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:20,366 INFO L93 Difference]: Finished difference Result 2800 states and 3814 transitions. [2025-03-03 09:46:20,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:46:20,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 203 [2025-03-03 09:46:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:20,371 INFO L225 Difference]: With dead ends: 2800 [2025-03-03 09:46:20,371 INFO L226 Difference]: Without dead ends: 1643 [2025-03-03 09:46:20,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:46:20,373 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:20,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 587 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:20,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2025-03-03 09:46:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1627. [2025-03-03 09:46:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1555 states have (on average 1.3337620578778135) internal successors, (2074), 1583 states have internal predecessors, (2074), 59 states have call successors, (59), 12 states have call predecessors, (59), 12 states have return successors, (59), 37 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 09:46:20,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2192 transitions. [2025-03-03 09:46:20,427 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2192 transitions. Word has length 203 [2025-03-03 09:46:20,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:20,428 INFO L471 AbstractCegarLoop]: Abstraction has 1627 states and 2192 transitions. [2025-03-03 09:46:20,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2192 transitions. [2025-03-03 09:46:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 09:46:20,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:20,431 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:20,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 09:46:20,431 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:20,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:20,431 INFO L85 PathProgramCache]: Analyzing trace with hash -760634855, now seen corresponding path program 1 times [2025-03-03 09:46:20,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:20,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024434971] [2025-03-03 09:46:20,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:20,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:20,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 09:46:20,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 09:46:20,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:20,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 09:46:20,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:20,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024434971] [2025-03-03 09:46:20,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024434971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:20,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:46:20,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:46:20,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756017039] [2025-03-03 09:46:20,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:20,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:46:20,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:20,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:46:20,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:46:20,575 INFO L87 Difference]: Start difference. First operand 1627 states and 2192 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:20,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:20,605 INFO L93 Difference]: Finished difference Result 2848 states and 3862 transitions. [2025-03-03 09:46:20,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:46:20,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 203 [2025-03-03 09:46:20,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:20,611 INFO L225 Difference]: With dead ends: 2848 [2025-03-03 09:46:20,611 INFO L226 Difference]: Without dead ends: 1659 [2025-03-03 09:46:20,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:46:20,613 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:20,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 589 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:20,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2025-03-03 09:46:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1659. [2025-03-03 09:46:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1587 states have (on average 1.3270321361058601) internal successors, (2106), 1615 states have internal predecessors, (2106), 59 states have call successors, (59), 12 states have call predecessors, (59), 12 states have return successors, (59), 37 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 09:46:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2224 transitions. [2025-03-03 09:46:20,651 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2224 transitions. Word has length 203 [2025-03-03 09:46:20,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:20,651 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2224 transitions. [2025-03-03 09:46:20,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2224 transitions. [2025-03-03 09:46:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 09:46:20,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:20,655 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:20,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 09:46:20,655 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:20,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash 641947355, now seen corresponding path program 2 times [2025-03-03 09:46:20,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:20,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488992101] [2025-03-03 09:46:20,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:46:20,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:20,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 203 statements into 2 equivalence classes. [2025-03-03 09:46:20,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 09:46:20,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:46:20,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-03-03 09:46:20,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:20,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488992101] [2025-03-03 09:46:20,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488992101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:20,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:46:20,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:46:20,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456182777] [2025-03-03 09:46:20,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:20,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:46:20,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:20,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:46:20,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:20,975 INFO L87 Difference]: Start difference. First operand 1659 states and 2224 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:21,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:21,148 INFO L93 Difference]: Finished difference Result 3264 states and 4342 transitions. [2025-03-03 09:46:21,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:46:21,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 203 [2025-03-03 09:46:21,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:21,155 INFO L225 Difference]: With dead ends: 3264 [2025-03-03 09:46:21,155 INFO L226 Difference]: Without dead ends: 2043 [2025-03-03 09:46:21,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:21,157 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 31 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:21,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 760 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:46:21,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2025-03-03 09:46:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 1755. [2025-03-03 09:46:21,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1683 states have (on average 1.298871063576946) internal successors, (2186), 1711 states have internal predecessors, (2186), 59 states have call successors, (59), 12 states have call predecessors, (59), 12 states have return successors, (59), 37 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 09:46:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2304 transitions. [2025-03-03 09:46:21,216 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2304 transitions. Word has length 203 [2025-03-03 09:46:21,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:21,217 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2304 transitions. [2025-03-03 09:46:21,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2304 transitions. [2025-03-03 09:46:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 09:46:21,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:21,221 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:21,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 09:46:21,223 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:21,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:21,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1702719686, now seen corresponding path program 1 times [2025-03-03 09:46:21,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:21,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921236298] [2025-03-03 09:46:21,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:21,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:21,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 09:46:21,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 09:46:21,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:21,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-03-03 09:46:21,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:21,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921236298] [2025-03-03 09:46:21,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921236298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:21,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:46:21,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:46:21,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544756071] [2025-03-03 09:46:21,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:21,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:46:21,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:21,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:46:21,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:46:21,390 INFO L87 Difference]: Start difference. First operand 1755 states and 2304 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:21,422 INFO L93 Difference]: Finished difference Result 3120 states and 4102 transitions. [2025-03-03 09:46:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:46:21,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 203 [2025-03-03 09:46:21,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:21,427 INFO L225 Difference]: With dead ends: 3120 [2025-03-03 09:46:21,427 INFO L226 Difference]: Without dead ends: 1803 [2025-03-03 09:46:21,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:46:21,428 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:21,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 592 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2025-03-03 09:46:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1787. [2025-03-03 09:46:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1715 states have (on average 1.2839650145772594) internal successors, (2202), 1743 states have internal predecessors, (2202), 59 states have call successors, (59), 12 states have call predecessors, (59), 12 states have return successors, (59), 37 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 09:46:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2320 transitions. [2025-03-03 09:46:21,461 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2320 transitions. Word has length 203 [2025-03-03 09:46:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:21,461 INFO L471 AbstractCegarLoop]: Abstraction has 1787 states and 2320 transitions. [2025-03-03 09:46:21,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2320 transitions. [2025-03-03 09:46:21,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 09:46:21,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:21,465 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:21,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 09:46:21,466 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:21,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:21,466 INFO L85 PathProgramCache]: Analyzing trace with hash -677227687, now seen corresponding path program 1 times [2025-03-03 09:46:21,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:21,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801205656] [2025-03-03 09:46:21,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:21,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:21,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 09:46:21,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 09:46:21,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:21,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2025-03-03 09:46:21,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:21,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801205656] [2025-03-03 09:46:21,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801205656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:21,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555003788] [2025-03-03 09:46:21,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:21,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:21,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:21,652 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:21,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 09:46:22,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 09:46:22,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 09:46:22,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:22,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:22,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:46:22,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-03 09:46:22,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:46:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2025-03-03 09:46:22,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555003788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:46:22,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:46:22,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-03 09:46:22,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321326484] [2025-03-03 09:46:22,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:46:22,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:46:22,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:22,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:46:22,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:46:22,164 INFO L87 Difference]: Start difference. First operand 1787 states and 2320 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:46:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:22,252 INFO L93 Difference]: Finished difference Result 3464 states and 4506 transitions. [2025-03-03 09:46:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:46:22,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 203 [2025-03-03 09:46:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:22,257 INFO L225 Difference]: With dead ends: 3464 [2025-03-03 09:46:22,257 INFO L226 Difference]: Without dead ends: 1831 [2025-03-03 09:46:22,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:46:22,259 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 40 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:22,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 783 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:46:22,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2025-03-03 09:46:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1831. [2025-03-03 09:46:22,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1751 states have (on average 1.2826956025128498) internal successors, (2246), 1783 states have internal predecessors, (2246), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 41 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-03 09:46:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2380 transitions. [2025-03-03 09:46:22,298 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2380 transitions. Word has length 203 [2025-03-03 09:46:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:22,299 INFO L471 AbstractCegarLoop]: Abstraction has 1831 states and 2380 transitions. [2025-03-03 09:46:22,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:46:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2380 transitions. [2025-03-03 09:46:22,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 09:46:22,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:22,303 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:22,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:22,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:22,503 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:22,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:22,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1928656999, now seen corresponding path program 2 times [2025-03-03 09:46:22,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:22,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426043868] [2025-03-03 09:46:22,504 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:46:22,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:22,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 215 statements into 2 equivalence classes. [2025-03-03 09:46:22,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 09:46:22,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:46:22,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2025-03-03 09:46:22,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:22,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426043868] [2025-03-03 09:46:22,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426043868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:22,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554671486] [2025-03-03 09:46:22,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:46:22,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:22,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:22,751 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:22,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-03 09:46:23,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 215 statements into 2 equivalence classes. [2025-03-03 09:46:23,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 09:46:23,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:46:23,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:23,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:46:23,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-03 09:46:23,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:46:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2025-03-03 09:46:23,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554671486] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:46:23,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:46:23,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-03 09:46:23,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406208440] [2025-03-03 09:46:23,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:46:23,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:46:23,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:23,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:46:23,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:46:23,576 INFO L87 Difference]: Start difference. First operand 1831 states and 2380 transitions. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:46:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:23,698 INFO L93 Difference]: Finished difference Result 3497 states and 4549 transitions. [2025-03-03 09:46:23,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:46:23,699 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 215 [2025-03-03 09:46:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:23,704 INFO L225 Difference]: With dead ends: 3497 [2025-03-03 09:46:23,704 INFO L226 Difference]: Without dead ends: 1864 [2025-03-03 09:46:23,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 422 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:46:23,707 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 57 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:23,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 987 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:46:23,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2025-03-03 09:46:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1864. [2025-03-03 09:46:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1778 states have (on average 1.28177727784027) internal successors, (2279), 1813 states have internal predecessors, (2279), 73 states have call successors, (73), 12 states have call predecessors, (73), 12 states have return successors, (73), 44 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-03 09:46:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2425 transitions. [2025-03-03 09:46:23,752 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2425 transitions. Word has length 215 [2025-03-03 09:46:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:23,752 INFO L471 AbstractCegarLoop]: Abstraction has 1864 states and 2425 transitions. [2025-03-03 09:46:23,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:46:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2425 transitions. [2025-03-03 09:46:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-03 09:46:23,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:23,756 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:23,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-03 09:46:23,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 09:46:23,957 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:23,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:23,957 INFO L85 PathProgramCache]: Analyzing trace with hash -756706284, now seen corresponding path program 3 times [2025-03-03 09:46:23,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:23,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465112889] [2025-03-03 09:46:23,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:46:23,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:23,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 224 statements into 11 equivalence classes. [2025-03-03 09:46:24,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 81 of 224 statements. [2025-03-03 09:46:24,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:46:24,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2025-03-03 09:46:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465112889] [2025-03-03 09:46:24,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465112889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334428057] [2025-03-03 09:46:24,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:46:24,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:24,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:24,403 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:24,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-03 09:46:24,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 224 statements into 11 equivalence classes. [2025-03-03 09:46:25,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 81 of 224 statements. [2025-03-03 09:46:25,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:46:25,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:25,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 09:46:25,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:25,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:46:25,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 135 [2025-03-03 09:46:25,143 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_tso_core_write_~tail~0_35 Int)) (let ((.cse1 (+ 16 |c_tso_core_write_#in~wrBuffer.offset|)) (.cse0 (select |c_old(#memory_int#8)| |c_tso_core_write_#in~wrBuffer.base|))) (and (<= v_tso_core_write_~tail~0_35 (mod (+ (select .cse0 .cse1) (select .cse0 (+ |c_tso_core_write_#in~wrBuffer.offset| 17))) 2)) (= |c_#memory_int#8| (store |c_old(#memory_int#8)| |c_tso_core_write_#in~wrBuffer.base| (let ((.cse2 (let ((.cse5 (* v_tso_core_write_~tail~0_35 8))) (let ((.cse4 (select |c_#memory_int#8| |c_tso_core_write_#in~wrBuffer.base|)) (.cse9 (+ 7 .cse5 |c_tso_core_write_#in~wrBuffer.offset|))) (store (let ((.cse8 (+ 6 .cse5 |c_tso_core_write_#in~wrBuffer.offset|))) (store (let ((.cse7 (+ 5 .cse5 |c_tso_core_write_#in~wrBuffer.offset|))) (store (let ((.cse6 (+ .cse5 |c_tso_core_write_#in~wrBuffer.offset| 4))) (store (let ((.cse3 (+ .cse5 |c_tso_core_write_#in~wrBuffer.offset|))) (store .cse0 .cse3 (select .cse4 .cse3))) .cse6 (select .cse4 .cse6))) .cse7 (select .cse4 .cse7))) .cse8 (select .cse4 .cse8))) .cse9 (select .cse4 .cse9)))))) (store .cse2 .cse1 (+ (mod (select .cse2 .cse1) 256) 1)))))))) is different from true [2025-03-03 09:46:25,171 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 220 treesize of output 209 [2025-03-03 09:46:25,196 INFO L349 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2025-03-03 09:46:25,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 331 [2025-03-03 09:46:25,332 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 28 treesize of output 10 [2025-03-03 09:46:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2025-03-03 09:46:25,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:25,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334428057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:25,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:25,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2025-03-03 09:46:25,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303540762] [2025-03-03 09:46:25,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:25,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:46:25,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:25,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:46:25,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2025-03-03 09:46:25,350 INFO L87 Difference]: Start difference. First operand 1864 states and 2425 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:26,256 INFO L93 Difference]: Finished difference Result 3347 states and 4353 transitions. [2025-03-03 09:46:26,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:46:26,257 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 224 [2025-03-03 09:46:26,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:26,264 INFO L225 Difference]: With dead ends: 3347 [2025-03-03 09:46:26,264 INFO L226 Difference]: Without dead ends: 1991 [2025-03-03 09:46:26,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2025-03-03 09:46:26,266 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 75 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:26,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1157 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 318 Invalid, 0 Unknown, 302 Unchecked, 0.8s Time] [2025-03-03 09:46:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2025-03-03 09:46:26,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1954. [2025-03-03 09:46:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1859 states have (on average 1.2813340505648199) internal successors, (2382), 1896 states have internal predecessors, (2382), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 51 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 09:46:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2546 transitions. [2025-03-03 09:46:26,358 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2546 transitions. Word has length 224 [2025-03-03 09:46:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:26,359 INFO L471 AbstractCegarLoop]: Abstraction has 1954 states and 2546 transitions. [2025-03-03 09:46:26,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2546 transitions. [2025-03-03 09:46:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-03 09:46:26,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:26,362 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:26,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:26,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:26,563 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:26,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:26,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1806480724, now seen corresponding path program 4 times [2025-03-03 09:46:26,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:26,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365766267] [2025-03-03 09:46:26,564 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:46:26,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:26,613 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 224 statements into 2 equivalence classes. [2025-03-03 09:46:26,643 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 09:46:26,644 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:46:26,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 09:46:26,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:26,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365766267] [2025-03-03 09:46:26,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365766267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:26,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131084215] [2025-03-03 09:46:26,801 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:46:26,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:26,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:26,803 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:26,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-03 09:46:27,238 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 224 statements into 2 equivalence classes. [2025-03-03 09:46:30,011 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 09:46:30,011 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:46:30,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:30,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:46:30,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 09:46:30,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:46:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 09:46:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131084215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:46:30,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:46:30,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 09:46:30,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588905451] [2025-03-03 09:46:30,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:46:30,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:46:30,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:30,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:46:30,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:46:30,215 INFO L87 Difference]: Start difference. First operand 1954 states and 2546 transitions. Second operand has 11 states, 11 states have (on average 20.272727272727273) internal successors, (223), 11 states have internal predecessors, (223), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:30,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:30,482 INFO L93 Difference]: Finished difference Result 10054 states and 13051 transitions. [2025-03-03 09:46:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:46:30,482 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.272727272727273) internal successors, (223), 11 states have internal predecessors, (223), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 224 [2025-03-03 09:46:30,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:30,497 INFO L225 Difference]: With dead ends: 10054 [2025-03-03 09:46:30,498 INFO L226 Difference]: Without dead ends: 10049 [2025-03-03 09:46:30,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 443 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:46:30,501 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 382 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:30,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 835 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:46:30,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10049 states. [2025-03-03 09:46:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10049 to 8139. [2025-03-03 09:46:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8139 states, 8044 states have (on average 1.2996021879661859) internal successors, (10454), 8081 states have internal predecessors, (10454), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 51 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 09:46:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8139 states to 8139 states and 10618 transitions. [2025-03-03 09:46:30,654 INFO L78 Accepts]: Start accepts. Automaton has 8139 states and 10618 transitions. Word has length 224 [2025-03-03 09:46:30,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:30,654 INFO L471 AbstractCegarLoop]: Abstraction has 8139 states and 10618 transitions. [2025-03-03 09:46:30,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.272727272727273) internal successors, (223), 11 states have internal predecessors, (223), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 8139 states and 10618 transitions. [2025-03-03 09:46:30,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 09:46:30,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:30,688 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:30,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-03 09:46:30,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:30,888 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:30,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:30,889 INFO L85 PathProgramCache]: Analyzing trace with hash -309672589, now seen corresponding path program 5 times [2025-03-03 09:46:30,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:30,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684297542] [2025-03-03 09:46:30,889 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:46:30,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:30,942 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 274 statements into 11 equivalence classes. [2025-03-03 09:46:30,959 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 84 of 274 statements. [2025-03-03 09:46:30,959 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:46:30,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 260 proven. 10 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2025-03-03 09:46:31,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:31,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684297542] [2025-03-03 09:46:31,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684297542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:31,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060803365] [2025-03-03 09:46:31,016 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:46:31,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:31,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:31,018 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:31,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-03 09:46:31,497 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 274 statements into 11 equivalence classes. [2025-03-03 09:46:31,517 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 84 of 274 statements. [2025-03-03 09:46:31,518 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:46:31,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:31,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 09:46:31,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 260 proven. 10 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2025-03-03 09:46:31,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:46:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 260 proven. 10 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2025-03-03 09:46:31,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060803365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:46:31,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:46:31,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 09:46:31,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552414010] [2025-03-03 09:46:31,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:46:31,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:46:31,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:31,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:46:31,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:46:31,619 INFO L87 Difference]: Start difference. First operand 8139 states and 10618 transitions. Second operand has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:31,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:31,761 INFO L93 Difference]: Finished difference Result 11266 states and 14679 transitions. [2025-03-03 09:46:31,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:46:31,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 274 [2025-03-03 09:46:31,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:31,774 INFO L225 Difference]: With dead ends: 11266 [2025-03-03 09:46:31,775 INFO L226 Difference]: Without dead ends: 8186 [2025-03-03 09:46:31,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 546 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:46:31,780 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 77 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:31,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 680 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:46:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8186 states. [2025-03-03 09:46:31,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8186 to 8048. [2025-03-03 09:46:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8048 states, 7953 states have (on average 1.2915880799698227) internal successors, (10272), 7990 states have internal predecessors, (10272), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 51 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 09:46:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8048 states to 8048 states and 10436 transitions. [2025-03-03 09:46:31,968 INFO L78 Accepts]: Start accepts. Automaton has 8048 states and 10436 transitions. Word has length 274 [2025-03-03 09:46:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:31,968 INFO L471 AbstractCegarLoop]: Abstraction has 8048 states and 10436 transitions. [2025-03-03 09:46:31,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:31,968 INFO L276 IsEmpty]: Start isEmpty. Operand 8048 states and 10436 transitions. [2025-03-03 09:46:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-03 09:46:31,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:31,982 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:31,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:32,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:32,186 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:32,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:32,187 INFO L85 PathProgramCache]: Analyzing trace with hash -29738384, now seen corresponding path program 6 times [2025-03-03 09:46:32,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:32,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132911454] [2025-03-03 09:46:32,187 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:46:32,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:32,262 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 304 statements into 11 equivalence classes. [2025-03-03 09:46:32,285 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 85 of 304 statements. [2025-03-03 09:46:32,286 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 09:46:32,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:32,696 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2025-03-03 09:46:32,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:32,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132911454] [2025-03-03 09:46:32,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132911454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:32,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104703506] [2025-03-03 09:46:32,696 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:46:32,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:32,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:32,699 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:32,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-03 09:46:33,251 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 304 statements into 11 equivalence classes. [2025-03-03 09:46:33,740 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 85 of 304 statements. [2025-03-03 09:46:33,741 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 09:46:33,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:33,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 09:46:33,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:33,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:46:33,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 146 [2025-03-03 09:46:33,813 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_25 Int) (v_tso_core_write_~tail~0_48 Int)) (let ((.cse7 (+ 16 |c_tso_core_write_#in~wrBuffer.offset|)) (.cse9 (select |c_old(#memory_int#8)| |c_tso_core_write_#in~wrBuffer.base|))) (and (= |c_#memory_int#8| (store |c_old(#memory_int#8)| |c_tso_core_write_#in~wrBuffer.base| (let ((.cse8 (* v_tso_core_write_~tail~0_48 8))) (let ((.cse5 (+ 7 .cse8 |c_tso_core_write_#in~wrBuffer.offset|)) (.cse3 (+ .cse8 6 |c_tso_core_write_#in~wrBuffer.offset|)) (.cse2 (select |c_#memory_int#8| |c_tso_core_write_#in~wrBuffer.base|))) (let ((.cse0 (let ((.cse11 (+ .cse8 |c_tso_core_write_#in~wrBuffer.offset| 4))) (store (let ((.cse10 (+ .cse8 |c_tso_core_write_#in~wrBuffer.offset|))) (store .cse9 .cse10 (select .cse2 .cse10))) .cse11 (select .cse2 .cse11)))) (.cse1 (+ 5 .cse8 |c_tso_core_write_#in~wrBuffer.offset|)) (.cse4 (select .cse2 .cse3)) (.cse6 (select .cse2 .cse5))) (store (store (store (store .cse0 .cse1 (select .cse2 .cse1)) .cse3 .cse4) .cse5 .cse6) .cse7 (+ (mod (select (store (store (store .cse0 .cse1 v_arrayElimCell_25) .cse3 .cse4) .cse5 .cse6) .cse7) 256) 1))))))) (<= v_tso_core_write_~tail~0_48 (mod (+ (select .cse9 .cse7) (select .cse9 (+ |c_tso_core_write_#in~wrBuffer.offset| 17))) 2))))) is different from true [2025-03-03 09:46:33,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 211 treesize of output 200 [2025-03-03 09:46:33,849 INFO L349 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2025-03-03 09:46:33,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 331 [2025-03-03 09:46:33,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:46:33,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 94 [2025-03-03 09:46:33,934 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 28 treesize of output 10 [2025-03-03 09:46:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2025-03-03 09:46:33,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:33,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104703506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:33,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:33,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2025-03-03 09:46:33,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325427771] [2025-03-03 09:46:33,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:33,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:46:33,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:33,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:46:33,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=128, Unknown=1, NotChecked=22, Total=182 [2025-03-03 09:46:33,949 INFO L87 Difference]: Start difference. First operand 8048 states and 10436 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:34,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:34,869 INFO L93 Difference]: Finished difference Result 15589 states and 20205 transitions. [2025-03-03 09:46:34,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:46:34,869 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 304 [2025-03-03 09:46:34,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:34,882 INFO L225 Difference]: With dead ends: 15589 [2025-03-03 09:46:34,882 INFO L226 Difference]: Without dead ends: 8139 [2025-03-03 09:46:34,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2025-03-03 09:46:34,888 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 75 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 301 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:34,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1159 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 316 Invalid, 0 Unknown, 301 Unchecked, 0.8s Time] [2025-03-03 09:46:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8139 states. [2025-03-03 09:46:34,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8139 to 8079. [2025-03-03 09:46:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8079 states, 7981 states have (on average 1.291567472747776) internal successors, (10308), 8018 states have internal predecessors, (10308), 85 states have call successors, (85), 12 states have call predecessors, (85), 12 states have return successors, (85), 54 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-03 09:46:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8079 states to 8079 states and 10478 transitions. [2025-03-03 09:46:34,986 INFO L78 Accepts]: Start accepts. Automaton has 8079 states and 10478 transitions. Word has length 304 [2025-03-03 09:46:34,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:34,986 INFO L471 AbstractCegarLoop]: Abstraction has 8079 states and 10478 transitions. [2025-03-03 09:46:34,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:34,987 INFO L276 IsEmpty]: Start isEmpty. Operand 8079 states and 10478 transitions. [2025-03-03 09:46:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-03 09:46:34,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:34,995 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:35,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-03 09:46:35,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:35,196 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:35,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1302810264, now seen corresponding path program 1 times [2025-03-03 09:46:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:35,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244583050] [2025-03-03 09:46:35,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:35,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:35,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-03 09:46:35,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-03 09:46:35,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:35,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 392 proven. 16 refuted. 0 times theorem prover too weak. 449 trivial. 0 not checked. [2025-03-03 09:46:35,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:35,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244583050] [2025-03-03 09:46:35,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244583050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:35,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967606189] [2025-03-03 09:46:35,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:35,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:35,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:35,448 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:35,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-03 09:46:35,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-03 09:46:36,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-03 09:46:36,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:36,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:36,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:46:36,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 384 proven. 57 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-03-03 09:46:36,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:46:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 384 proven. 57 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-03-03 09:46:36,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967606189] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:46:36,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:46:36,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2025-03-03 09:46:36,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766723984] [2025-03-03 09:46:36,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:46:36,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:46:36,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:36,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:46:36,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:46:36,249 INFO L87 Difference]: Start difference. First operand 8079 states and 10478 transitions. Second operand has 13 states, 13 states have (on average 24.692307692307693) internal successors, (321), 13 states have internal predecessors, (321), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:36,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:36,683 INFO L93 Difference]: Finished difference Result 13870 states and 17971 transitions. [2025-03-03 09:46:36,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 09:46:36,684 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 24.692307692307693) internal successors, (321), 13 states have internal predecessors, (321), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 306 [2025-03-03 09:46:36,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:36,702 INFO L225 Difference]: With dead ends: 13870 [2025-03-03 09:46:36,702 INFO L226 Difference]: Without dead ends: 10824 [2025-03-03 09:46:36,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 610 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=212, Invalid=388, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:46:36,708 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 271 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:36,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1206 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:46:36,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10824 states. [2025-03-03 09:46:36,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10824 to 8033. [2025-03-03 09:46:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8033 states, 7935 states have (on average 1.2874606175173282) internal successors, (10216), 7972 states have internal predecessors, (10216), 85 states have call successors, (85), 12 states have call predecessors, (85), 12 states have return successors, (85), 54 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-03 09:46:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8033 states to 8033 states and 10386 transitions. [2025-03-03 09:46:36,845 INFO L78 Accepts]: Start accepts. Automaton has 8033 states and 10386 transitions. Word has length 306 [2025-03-03 09:46:36,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:36,845 INFO L471 AbstractCegarLoop]: Abstraction has 8033 states and 10386 transitions. [2025-03-03 09:46:36,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 24.692307692307693) internal successors, (321), 13 states have internal predecessors, (321), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 8033 states and 10386 transitions. [2025-03-03 09:46:36,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-03 09:46:36,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:36,855 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:36,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:37,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-03 09:46:37,056 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:37,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:37,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1528195338, now seen corresponding path program 2 times [2025-03-03 09:46:37,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:37,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885610415] [2025-03-03 09:46:37,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:46:37,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:37,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 346 statements into 2 equivalence classes. [2025-03-03 09:46:37,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 346 of 346 statements. [2025-03-03 09:46:37,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:46:37,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 288 proven. 23 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2025-03-03 09:46:37,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:37,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885610415] [2025-03-03 09:46:37,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885610415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:37,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579819373] [2025-03-03 09:46:37,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:46:37,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:37,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:37,249 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:37,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-03 09:46:37,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 346 statements into 2 equivalence classes. [2025-03-03 09:46:38,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 346 of 346 statements. [2025-03-03 09:46:38,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:46:38,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:38,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 1414 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:38,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 288 proven. 23 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2025-03-03 09:46:38,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:46:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 288 proven. 23 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2025-03-03 09:46:38,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579819373] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:46:38,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:46:38,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 09:46:38,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437653058] [2025-03-03 09:46:38,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:46:38,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:46:38,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:38,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:46:38,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:38,227 INFO L87 Difference]: Start difference. First operand 8033 states and 10386 transitions. Second operand has 6 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:38,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:38,387 INFO L93 Difference]: Finished difference Result 14377 states and 18595 transitions. [2025-03-03 09:46:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:46:38,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 346 [2025-03-03 09:46:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:38,400 INFO L225 Difference]: With dead ends: 14377 [2025-03-03 09:46:38,400 INFO L226 Difference]: Without dead ends: 11491 [2025-03-03 09:46:38,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 688 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:46:38,406 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 124 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:38,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 755 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:46:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11491 states. [2025-03-03 09:46:38,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11491 to 7949. [2025-03-03 09:46:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7949 states, 7851 states have (on average 1.2798369634441473) internal successors, (10048), 7888 states have internal predecessors, (10048), 85 states have call successors, (85), 12 states have call predecessors, (85), 12 states have return successors, (85), 54 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-03 09:46:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7949 states to 7949 states and 10218 transitions. [2025-03-03 09:46:38,544 INFO L78 Accepts]: Start accepts. Automaton has 7949 states and 10218 transitions. Word has length 346 [2025-03-03 09:46:38,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:38,544 INFO L471 AbstractCegarLoop]: Abstraction has 7949 states and 10218 transitions. [2025-03-03 09:46:38,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:38,544 INFO L276 IsEmpty]: Start isEmpty. Operand 7949 states and 10218 transitions. [2025-03-03 09:46:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-03 09:46:38,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:38,553 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:38,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:38,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-03 09:46:38,754 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:38,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:38,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1349134156, now seen corresponding path program 1 times [2025-03-03 09:46:38,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:38,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669021486] [2025-03-03 09:46:38,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:38,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:38,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-03 09:46:38,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-03 09:46:38,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:38,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2025-03-03 09:46:40,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:40,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669021486] [2025-03-03 09:46:40,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669021486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:40,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459322761] [2025-03-03 09:46:40,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:40,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:40,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:40,963 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:40,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-03 09:46:41,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-03 09:46:41,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-03 09:46:41,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:41,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:41,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 1409 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 09:46:41,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:41,950 INFO L224 Elim1Store]: Index analysis took 191 ms [2025-03-03 09:46:41,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 276 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 9 [2025-03-03 09:46:42,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:46:42,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 36 [2025-03-03 09:46:42,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:46:42,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2025-03-03 09:46:42,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:46:42,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2025-03-03 09:46:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1105 trivial. 0 not checked. [2025-03-03 09:46:42,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:42,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459322761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:42,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:42,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2025-03-03 09:46:42,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015861702] [2025-03-03 09:46:42,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:42,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:46:42,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:42,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:46:42,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:46:42,291 INFO L87 Difference]: Start difference. First operand 7949 states and 10218 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 09:46:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:43,305 INFO L93 Difference]: Finished difference Result 15546 states and 19954 transitions. [2025-03-03 09:46:43,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:46:43,305 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 376 [2025-03-03 09:46:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:43,317 INFO L225 Difference]: With dead ends: 15546 [2025-03-03 09:46:43,317 INFO L226 Difference]: Without dead ends: 8226 [2025-03-03 09:46:43,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 374 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:46:43,325 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 270 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:43,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 911 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:46:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8226 states. [2025-03-03 09:46:43,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8226 to 8137. [2025-03-03 09:46:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8137 states, 8014 states have (on average 1.2788869478412777) internal successors, (10249), 8063 states have internal predecessors, (10249), 110 states have call successors, (110), 12 states have call predecessors, (110), 12 states have return successors, (110), 69 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-03 09:46:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8137 states to 8137 states and 10469 transitions. [2025-03-03 09:46:43,446 INFO L78 Accepts]: Start accepts. Automaton has 8137 states and 10469 transitions. Word has length 376 [2025-03-03 09:46:43,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:43,447 INFO L471 AbstractCegarLoop]: Abstraction has 8137 states and 10469 transitions. [2025-03-03 09:46:43,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 09:46:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 8137 states and 10469 transitions. [2025-03-03 09:46:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-03-03 09:46:43,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:43,455 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:43,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:43,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-03 09:46:43,658 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:43,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:43,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1834280282, now seen corresponding path program 1 times [2025-03-03 09:46:43,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:43,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375271102] [2025-03-03 09:46:43,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:43,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:43,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-03-03 09:46:43,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-03-03 09:46:43,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:43,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:45,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2025-03-03 09:46:45,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:45,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375271102] [2025-03-03 09:46:45,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375271102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:45,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128216688] [2025-03-03 09:46:45,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:45,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:45,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:45,154 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:45,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-03 09:46:45,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-03-03 09:46:45,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-03-03 09:46:45,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:45,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:45,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 1516 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 09:46:45,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:45,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:46:45,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 280 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 125 [2025-03-03 09:46:46,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:46:46,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 145 treesize of output 51 [2025-03-03 09:46:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2025-03-03 09:46:46,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:46,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128216688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:46,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:46,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2025-03-03 09:46:46,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506831650] [2025-03-03 09:46:46,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:46,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:46:46,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:46,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:46:46,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:46:46,104 INFO L87 Difference]: Start difference. First operand 8137 states and 10469 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:46,519 INFO L93 Difference]: Finished difference Result 16136 states and 20739 transitions. [2025-03-03 09:46:46,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:46:46,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 381 [2025-03-03 09:46:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:46,527 INFO L225 Difference]: With dead ends: 16136 [2025-03-03 09:46:46,527 INFO L226 Difference]: Without dead ends: 8130 [2025-03-03 09:46:46,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:46:46,534 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 38 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:46,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 897 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:46:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8130 states. [2025-03-03 09:46:46,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8130 to 8103. [2025-03-03 09:46:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 7988 states have (on average 1.2784176264396594) internal successors, (10212), 8029 states have internal predecessors, (10212), 102 states have call successors, (102), 12 states have call predecessors, (102), 12 states have return successors, (102), 69 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 09:46:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 10416 transitions. [2025-03-03 09:46:46,642 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 10416 transitions. Word has length 381 [2025-03-03 09:46:46,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:46,643 INFO L471 AbstractCegarLoop]: Abstraction has 8103 states and 10416 transitions. [2025-03-03 09:46:46,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:46,643 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 10416 transitions. [2025-03-03 09:46:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-03-03 09:46:46,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:46,651 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:46,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:46,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:46,851 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:46,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:46,852 INFO L85 PathProgramCache]: Analyzing trace with hash -116288917, now seen corresponding path program 1 times [2025-03-03 09:46:46,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:46,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869747972] [2025-03-03 09:46:46,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:46,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:46,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-03 09:46:46,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-03 09:46:46,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:46,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 1082 trivial. 0 not checked. [2025-03-03 09:46:48,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:48,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869747972] [2025-03-03 09:46:48,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869747972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:48,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658947721] [2025-03-03 09:46:48,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:48,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:48,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:48,678 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:48,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-03 09:46:49,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-03 09:46:49,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-03 09:46:49,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:49,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:49,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 1621 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 09:46:49,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:49,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 188 [2025-03-03 09:46:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2025-03-03 09:46:49,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:46:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 38 proven. 4 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2025-03-03 09:46:51,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658947721] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:46:51,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:46:51,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 22 [2025-03-03 09:46:51,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313595583] [2025-03-03 09:46:51,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:46:51,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 09:46:51,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:51,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 09:46:51,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:46:51,115 INFO L87 Difference]: Start difference. First operand 8103 states and 10416 transitions. Second operand has 22 states, 22 states have (on average 9.0) internal successors, (198), 20 states have internal predecessors, (198), 7 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (17), 10 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-03 09:46:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:54,652 INFO L93 Difference]: Finished difference Result 16527 states and 21245 transitions. [2025-03-03 09:46:54,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 09:46:54,652 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.0) internal successors, (198), 20 states have internal predecessors, (198), 7 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (17), 10 states have call predecessors, (17), 7 states have call successors, (17) Word has length 389 [2025-03-03 09:46:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:54,661 INFO L225 Difference]: With dead ends: 16527 [2025-03-03 09:46:54,661 INFO L226 Difference]: Without dead ends: 8563 [2025-03-03 09:46:54,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 815 GetRequests, 775 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=1373, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 09:46:54,672 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 347 mSDsluCounter, 2417 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 2591 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:54,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 2591 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 09:46:54,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8563 states. [2025-03-03 09:46:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8563 to 8367. [2025-03-03 09:46:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8367 states, 8222 states have (on average 1.278034541474094) internal successors, (10508), 8271 states have internal predecessors, (10508), 132 states have call successors, (132), 12 states have call predecessors, (132), 12 states have return successors, (132), 95 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 09:46:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8367 states to 8367 states and 10772 transitions. [2025-03-03 09:46:54,829 INFO L78 Accepts]: Start accepts. Automaton has 8367 states and 10772 transitions. Word has length 389 [2025-03-03 09:46:54,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:54,830 INFO L471 AbstractCegarLoop]: Abstraction has 8367 states and 10772 transitions. [2025-03-03 09:46:54,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.0) internal successors, (198), 20 states have internal predecessors, (198), 7 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (17), 10 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-03 09:46:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 8367 states and 10772 transitions. [2025-03-03 09:46:54,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-03-03 09:46:54,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:54,838 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:54,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-03 09:46:55,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-03 09:46:55,039 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:55,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash -153352621, now seen corresponding path program 1 times [2025-03-03 09:46:55,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:55,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861873488] [2025-03-03 09:46:55,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:55,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:55,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-03-03 09:46:55,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-03 09:46:55,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:55,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 1086 trivial. 0 not checked. [2025-03-03 09:46:57,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:57,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861873488] [2025-03-03 09:46:57,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861873488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:57,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970976051] [2025-03-03 09:46:57,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:57,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:57,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:57,304 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:57,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-03 09:46:57,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-03-03 09:46:58,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-03 09:46:58,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:58,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:58,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 1975 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 09:46:58,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:58,228 INFO L224 Elim1Store]: Index analysis took 155 ms [2025-03-03 09:46:58,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 276 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 9 [2025-03-03 09:46:58,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:46:58,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 15 [2025-03-03 09:46:58,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 1116 trivial. 0 not checked. [2025-03-03 09:46:58,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:58,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970976051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:58,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:58,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-03 09:46:58,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077091630] [2025-03-03 09:46:58,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:58,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:46:58,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:58,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:46:58,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:46:58,286 INFO L87 Difference]: Start difference. First operand 8367 states and 10772 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 09:46:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:58,545 INFO L93 Difference]: Finished difference Result 16663 states and 21447 transitions. [2025-03-03 09:46:58,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:46:58,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 417 [2025-03-03 09:46:58,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:58,553 INFO L225 Difference]: With dead ends: 16663 [2025-03-03 09:46:58,554 INFO L226 Difference]: Without dead ends: 8330 [2025-03-03 09:46:58,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:46:58,562 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 10 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:58,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 730 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:46:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8330 states. [2025-03-03 09:46:58,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8330 to 8330. [2025-03-03 09:46:58,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8330 states, 8194 states have (on average 1.277764217720283) internal successors, (10470), 8234 states have internal predecessors, (10470), 123 states have call successors, (123), 12 states have call predecessors, (123), 12 states have return successors, (123), 95 states have call predecessors, (123), 123 states have call successors, (123) [2025-03-03 09:46:58,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8330 states to 8330 states and 10716 transitions. [2025-03-03 09:46:58,708 INFO L78 Accepts]: Start accepts. Automaton has 8330 states and 10716 transitions. Word has length 417 [2025-03-03 09:46:58,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:58,709 INFO L471 AbstractCegarLoop]: Abstraction has 8330 states and 10716 transitions. [2025-03-03 09:46:58,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 09:46:58,709 INFO L276 IsEmpty]: Start isEmpty. Operand 8330 states and 10716 transitions. [2025-03-03 09:46:58,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-03-03 09:46:58,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:58,717 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:46:58,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:58,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-03 09:46:58,918 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:58,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:58,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1828579618, now seen corresponding path program 1 times [2025-03-03 09:46:58,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:58,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110203959] [2025-03-03 09:46:58,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:58,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:58,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-03-03 09:46:59,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-03-03 09:46:59,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:59,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 5 proven. 52 refuted. 0 times theorem prover too weak. 1087 trivial. 0 not checked. [2025-03-03 09:47:01,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:01,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110203959] [2025-03-03 09:47:01,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110203959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:47:01,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294771620] [2025-03-03 09:47:01,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:47:01,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:47:01,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:47:01,047 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:47:01,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-03 09:47:01,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-03-03 09:47:01,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-03-03 09:47:01,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:47:01,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:01,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 2080 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 09:47:01,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:47:01,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:47:01,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 280 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 91 [2025-03-03 09:47:02,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:47:02,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 111 treesize of output 39 [2025-03-03 09:47:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2025-03-03 09:47:02,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:47:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 38 proven. 4 refuted. 0 times theorem prover too weak. 1102 trivial. 0 not checked. [2025-03-03 09:47:04,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294771620] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:47:04,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:47:04,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 20 [2025-03-03 09:47:04,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976567131] [2025-03-03 09:47:04,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:47:04,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 09:47:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:04,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 09:47:04,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:47:04,142 INFO L87 Difference]: Start difference. First operand 8330 states and 10716 transitions. Second operand has 20 states, 20 states have (on average 11.35) internal successors, (227), 18 states have internal predecessors, (227), 8 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (23), 11 states have call predecessors, (23), 8 states have call successors, (23) [2025-03-03 09:47:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:05,339 INFO L93 Difference]: Finished difference Result 16950 states and 21812 transitions. [2025-03-03 09:47:05,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 09:47:05,339 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.35) internal successors, (227), 18 states have internal predecessors, (227), 8 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (23), 11 states have call predecessors, (23), 8 states have call successors, (23) Word has length 425 [2025-03-03 09:47:05,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:05,348 INFO L225 Difference]: With dead ends: 16950 [2025-03-03 09:47:05,349 INFO L226 Difference]: Without dead ends: 8659 [2025-03-03 09:47:05,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 850 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:47:05,357 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 220 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:05,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1802 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:47:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8659 states. [2025-03-03 09:47:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8659 to 8517. [2025-03-03 09:47:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8517 states, 8358 states have (on average 1.2779373055754966) internal successors, (10681), 8406 states have internal predecessors, (10681), 146 states have call successors, (146), 12 states have call predecessors, (146), 12 states have return successors, (146), 114 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-03 09:47:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8517 states to 8517 states and 10973 transitions. [2025-03-03 09:47:05,557 INFO L78 Accepts]: Start accepts. Automaton has 8517 states and 10973 transitions. Word has length 425 [2025-03-03 09:47:05,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:05,558 INFO L471 AbstractCegarLoop]: Abstraction has 8517 states and 10973 transitions. [2025-03-03 09:47:05,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.35) internal successors, (227), 18 states have internal predecessors, (227), 8 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (23), 11 states have call predecessors, (23), 8 states have call successors, (23) [2025-03-03 09:47:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 8517 states and 10973 transitions. [2025-03-03 09:47:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-03 09:47:05,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:05,572 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:47:05,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-03 09:47:05,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-03 09:47:05,773 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:05,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:05,773 INFO L85 PathProgramCache]: Analyzing trace with hash -359057102, now seen corresponding path program 1 times [2025-03-03 09:47:05,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:05,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025395146] [2025-03-03 09:47:05,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:47:05,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:05,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-03 09:47:06,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-03 09:47:06,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:47:06,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat