./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_queue-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 38d92478d67c3996e3815aaa6d0075347cfc456da7f20d1b1bb733d11593b6cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:52:11,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:52:11,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:52:11,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:52:11,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:52:11,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:52:11,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:52:11,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:52:11,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:52:11,653 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:52:11,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:52:11,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:52:11,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:52:11,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:52:11,653 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:52:11,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:52:11,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:52:11,653 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:52:11,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:52:11,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:52:11,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:52:11,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:52:11,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:52:11,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:52:11,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:52:11,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:52:11,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:52:11,654 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-jdk21/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 -> 38d92478d67c3996e3815aaa6d0075347cfc456da7f20d1b1bb733d11593b6cf [2025-02-05 16:52:11,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:52:11,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:52:11,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:52:11,881 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:52:11,882 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:52:11,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_queue-1.i [2025-02-05 16:52:13,111 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cb157b7b/6985e05e15264a88ab5bef8b3af2bb37/FLAGd234288e0 [2025-02-05 16:52:13,469 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:52:13,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_queue-1.i [2025-02-05 16:52:13,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cb157b7b/6985e05e15264a88ab5bef8b3af2bb37/FLAGd234288e0 [2025-02-05 16:52:13,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cb157b7b/6985e05e15264a88ab5bef8b3af2bb37 [2025-02-05 16:52:13,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:52:13,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:52:13,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:52:13,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:52:13,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:52:13,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:52:13" (1/1) ... [2025-02-05 16:52:13,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ac2721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:13, skipping insertion in model container [2025-02-05 16:52:13,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:52:13" (1/1) ... [2025-02-05 16:52:13,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:52:13,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_queue-1.i[34744,34757] [2025-02-05 16:52:14,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:52:14,096 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:52:14,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_queue-1.i[34744,34757] [2025-02-05 16:52:14,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:52:14,233 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:52:14,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14 WrapperNode [2025-02-05 16:52:14,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:52:14,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:52:14,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:52:14,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:52:14,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,336 INFO L138 Inliner]: procedures = 251, calls = 629, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1399 [2025-02-05 16:52:14,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:52:14,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:52:14,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:52:14,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:52:14,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,395 INFO L175 MemorySlicer]: Split 397 memory accesses to 20 slices as follows [2, 8, 8, 8, 20, 12, 82, 8, 8, 41, 3, 7, 3, 8, 7, 50, 0, 113, 3, 6]. 28 percent of accesses are in the largest equivalence class. The 117 initializations are split as follows [2, 3, 3, 3, 6, 6, 40, 2, 2, 0, 0, 0, 0, 2, 0, 0, 0, 46, 0, 2]. The 94 writes are split as follows [0, 2, 2, 2, 8, 3, 21, 4, 4, 1, 1, 1, 1, 3, 1, 4, 0, 33, 1, 2]. [2025-02-05 16:52:14,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:52:14,472 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:52:14,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:52:14,472 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:52:14,472 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:52:14,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:14,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:52:14,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:52:14,565 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 16:52:14,566 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure empty [2025-02-05 16:52:14,566 INFO L138 BoogieDeclarations]: Found implementation of procedure empty [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-02-05 16:52:14,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 16:52:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-02-05 16:52:14,567 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 16:52:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 16:52:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-05 16:52:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-05 16:52:14,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-05 16:52:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-05 16:52:14,575 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-05 16:52:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:52:14,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:52:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-05 16:52:14,575 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-05 16:52:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:52:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:52:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 16:52:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 16:52:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 16:52:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 16:52:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 16:52:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 16:52:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 16:52:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 16:52:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 16:52:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 16:52:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 16:52:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 16:52:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 16:52:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 16:52:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 16:52:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 16:52:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 16:52:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 16:52:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:52:14,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:52:14,876 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:52:14,878 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:52:14,945 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L976: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-02-05 16:52:14,945 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L976: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:14,945 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L976-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:14,945 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L971: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-02-05 16:52:14,945 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L971: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:14,945 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L971-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,416 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-02-05 16:52:15,417 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,418 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,418 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-05 16:52:15,418 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,418 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,418 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-05 16:52:15,418 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,418 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,418 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);enqueue_#res#1 := 0; [2025-02-05 16:52:15,419 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,419 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,419 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-02-05 16:52:15,419 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,419 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,419 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);dequeue_#res#1 := 0; [2025-02-05 16:52:15,419 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,419 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,419 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-02-05 16:52:15,419 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,419 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1091-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-02-05 16:52:15,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1091-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1091-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1108-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-02-05 16:52:15,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1108-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1108-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1125-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-05 16:52:15,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1125-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1125-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:19,954 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-02-05 16:52:19,955 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:52:19,971 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:52:19,971 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:52:19,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:52:19 BoogieIcfgContainer [2025-02-05 16:52:19,972 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:52:19,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:52:19,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:52:19,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:52:19,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:52:13" (1/3) ... [2025-02-05 16:52:19,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bc0c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:52:19, skipping insertion in model container [2025-02-05 16:52:19,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (2/3) ... [2025-02-05 16:52:19,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bc0c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:52:19, skipping insertion in model container [2025-02-05 16:52:19,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:52:19" (3/3) ... [2025-02-05 16:52:19,982 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_queue-1.i [2025-02-05 16:52:19,994 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:52:19,995 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_queue-1.i that has 10 procedures, 336 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-05 16:52:20,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:52:20,061 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;@1a0590d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:52:20,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:52:20,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 336 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 195 states have internal predecessors, (283), 132 states have call successors, (132), 9 states have call predecessors, (132), 9 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-02-05 16:52:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-05 16:52:20,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:20,097 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:52:20,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:20,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:20,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1287243078, now seen corresponding path program 1 times [2025-02-05 16:52:20,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:20,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255503434] [2025-02-05 16:52:20,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:20,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:20,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-05 16:52:20,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-05 16:52:20,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:20,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-02-05 16:52:21,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:21,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255503434] [2025-02-05 16:52:21,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255503434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:21,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:21,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:52:21,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229872415] [2025-02-05 16:52:21,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:21,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:52:21,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:21,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:52:21,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:52:21,317 INFO L87 Difference]: Start difference. First operand has 336 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 195 states have internal predecessors, (283), 132 states have call successors, (132), 9 states have call predecessors, (132), 9 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-02-05 16:52:25,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:25,529 INFO L93 Difference]: Finished difference Result 667 states and 1212 transitions. [2025-02-05 16:52:25,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:52:25,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 325 [2025-02-05 16:52:25,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:25,540 INFO L225 Difference]: With dead ends: 667 [2025-02-05 16:52:25,540 INFO L226 Difference]: Without dead ends: 333 [2025-02-05 16:52:25,547 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-02-05 16:52:25,549 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 6 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:25,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1065 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-05 16:52:25,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-05 16:52:25,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2025-02-05 16:52:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 189 states have (on average 1.4550264550264551) internal successors, (275), 191 states have internal predecessors, (275), 131 states have call successors, (131), 9 states have call predecessors, (131), 9 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-02-05 16:52:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 536 transitions. [2025-02-05 16:52:25,615 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 536 transitions. Word has length 325 [2025-02-05 16:52:25,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:25,615 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 536 transitions. [2025-02-05 16:52:25,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-02-05 16:52:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 536 transitions. [2025-02-05 16:52:25,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-05 16:52:25,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:25,621 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:52:25,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:52:25,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:25,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:25,622 INFO L85 PathProgramCache]: Analyzing trace with hash 839483146, now seen corresponding path program 1 times [2025-02-05 16:52:25,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:25,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934753661] [2025-02-05 16:52:25,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:25,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:25,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-05 16:52:26,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-05 16:52:26,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:26,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5305 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-02-05 16:52:26,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:26,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934753661] [2025-02-05 16:52:26,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934753661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:26,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:26,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:52:26,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373345710] [2025-02-05 16:52:26,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:26,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:52:26,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:26,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:52:26,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:52:26,297 INFO L87 Difference]: Start difference. First operand 330 states and 536 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-02-05 16:52:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:26,368 INFO L93 Difference]: Finished difference Result 660 states and 1075 transitions. [2025-02-05 16:52:26,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:52:26,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 329 [2025-02-05 16:52:26,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:26,372 INFO L225 Difference]: With dead ends: 660 [2025-02-05 16:52:26,376 INFO L226 Difference]: Without dead ends: 333 [2025-02-05 16:52:26,378 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-02-05 16:52:26,382 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 0 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:26,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1059 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:52:26,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-05 16:52:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-02-05 16:52:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 192 states have (on average 1.4479166666666667) internal successors, (278), 194 states have internal predecessors, (278), 131 states have call successors, (131), 9 states have call predecessors, (131), 9 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-02-05 16:52:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 539 transitions. [2025-02-05 16:52:26,426 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 539 transitions. Word has length 329 [2025-02-05 16:52:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:26,426 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 539 transitions. [2025-02-05 16:52:26,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-02-05 16:52:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 539 transitions. [2025-02-05 16:52:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-05 16:52:26,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:26,431 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:52:26,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:52:26,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:26,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:26,434 INFO L85 PathProgramCache]: Analyzing trace with hash -878384287, now seen corresponding path program 1 times [2025-02-05 16:52:26,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:26,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548819376] [2025-02-05 16:52:26,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:26,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:26,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-05 16:52:26,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-05 16:52:26,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:26,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5308 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2025-02-05 16:52:27,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:27,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548819376] [2025-02-05 16:52:27,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548819376] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:27,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442787937] [2025-02-05 16:52:27,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:27,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:27,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:27,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:27,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:52:27,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-05 16:52:28,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-05 16:52:28,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:28,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:28,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:52:28,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5308 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2025-02-05 16:52:28,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:52:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5308 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2025-02-05 16:52:28,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442787937] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:52:28,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:52:28,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 16:52:28,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688759245] [2025-02-05 16:52:28,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:52:28,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:52:28,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:28,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:52:28,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:52:28,701 INFO L87 Difference]: Start difference. First operand 333 states and 539 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 1 states have call successors, (105), 2 states have call predecessors, (105), 2 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 16:52:28,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:28,857 INFO L93 Difference]: Finished difference Result 670 states and 1089 transitions. [2025-02-05 16:52:28,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:52:28,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 1 states have call successors, (105), 2 states have call predecessors, (105), 2 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 332 [2025-02-05 16:52:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:28,862 INFO L225 Difference]: With dead ends: 670 [2025-02-05 16:52:28,862 INFO L226 Difference]: Without dead ends: 340 [2025-02-05 16:52:28,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:52:28,864 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 0 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:28,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2112 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:52:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-02-05 16:52:28,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-02-05 16:52:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 199 states have (on average 1.4321608040201006) internal successors, (285), 201 states have internal predecessors, (285), 131 states have call successors, (131), 9 states have call predecessors, (131), 9 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-02-05 16:52:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 546 transitions. [2025-02-05 16:52:28,882 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 546 transitions. Word has length 332 [2025-02-05 16:52:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:28,883 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 546 transitions. [2025-02-05 16:52:28,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 1 states have call successors, (105), 2 states have call predecessors, (105), 2 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-05 16:52:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 546 transitions. [2025-02-05 16:52:28,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-02-05 16:52:28,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:28,887 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:28,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:52:29,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:29,091 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:29,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:29,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1785173654, now seen corresponding path program 2 times [2025-02-05 16:52:29,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:29,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629198601] [2025-02-05 16:52:29,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:52:29,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:29,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 339 statements into 2 equivalence classes. [2025-02-05 16:52:29,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 339 statements. [2025-02-05 16:52:29,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:52:29,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5328 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5328 trivial. 0 not checked. [2025-02-05 16:52:29,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:29,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629198601] [2025-02-05 16:52:29,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629198601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:29,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:29,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:52:29,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40997011] [2025-02-05 16:52:29,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:29,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:52:29,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:29,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:52:29,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:29,863 INFO L87 Difference]: Start difference. First operand 340 states and 546 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-02-05 16:52:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:30,144 INFO L93 Difference]: Finished difference Result 667 states and 1079 transitions. [2025-02-05 16:52:30,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:52:30,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 339 [2025-02-05 16:52:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:30,150 INFO L225 Difference]: With dead ends: 667 [2025-02-05 16:52:30,150 INFO L226 Difference]: Without dead ends: 665 [2025-02-05 16:52:30,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:52:30,151 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 416 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:30,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 2146 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:52:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-02-05 16:52:30,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 662. [2025-02-05 16:52:30,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 381 states have (on average 1.4383202099737533) internal successors, (548), 384 states have internal predecessors, (548), 261 states have call successors, (261), 19 states have call predecessors, (261), 19 states have return successors, (266), 260 states have call predecessors, (266), 259 states have call successors, (266) [2025-02-05 16:52:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1075 transitions. [2025-02-05 16:52:30,199 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1075 transitions. Word has length 339 [2025-02-05 16:52:30,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:30,200 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1075 transitions. [2025-02-05 16:52:30,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-02-05 16:52:30,200 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1075 transitions. [2025-02-05 16:52:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-02-05 16:52:30,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:30,207 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:30,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:52:30,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:30,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:30,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1925682201, now seen corresponding path program 1 times [2025-02-05 16:52:30,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:30,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059014951] [2025-02-05 16:52:30,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:30,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:30,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-02-05 16:52:30,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-02-05 16:52:30,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:30,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5330 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2025-02-05 16:52:30,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:30,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059014951] [2025-02-05 16:52:30,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059014951] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:30,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360777559] [2025-02-05 16:52:30,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:30,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:30,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:30,896 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:30,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:52:31,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-02-05 16:52:31,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-02-05 16:52:31,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:31,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:31,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 2226 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 16:52:31,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5330 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 5319 trivial. 0 not checked. [2025-02-05 16:52:32,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:52:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5330 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 5317 trivial. 0 not checked. [2025-02-05 16:52:32,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360777559] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:52:32,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:52:32,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-02-05 16:52:32,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261786928] [2025-02-05 16:52:32,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:52:32,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:52:32,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:32,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:52:32,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:52:32,910 INFO L87 Difference]: Start difference. First operand 662 states and 1075 transitions. Second operand has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 1 states have call successors, (107), 2 states have call predecessors, (107), 2 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 16:52:37,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:41,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:41,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:41,887 INFO L93 Difference]: Finished difference Result 1361 states and 2217 transitions. [2025-02-05 16:52:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 16:52:41,888 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 1 states have call successors, (107), 2 states have call predecessors, (107), 2 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 344 [2025-02-05 16:52:41,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:41,893 INFO L225 Difference]: With dead ends: 1361 [2025-02-05 16:52:41,893 INFO L226 Difference]: Without dead ends: 702 [2025-02-05 16:52:41,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 678 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=396, Invalid=726, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 16:52:41,896 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 29 mSDsluCounter, 3162 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 77 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3691 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:41,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3691 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 46 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-02-05 16:52:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-02-05 16:52:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-02-05 16:52:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 421 states have (on average 1.4038004750593824) internal successors, (591), 424 states have internal predecessors, (591), 261 states have call successors, (261), 19 states have call predecessors, (261), 19 states have return successors, (266), 260 states have call predecessors, (266), 259 states have call successors, (266) [2025-02-05 16:52:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1118 transitions. [2025-02-05 16:52:41,929 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1118 transitions. Word has length 344 [2025-02-05 16:52:41,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:41,929 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1118 transitions. [2025-02-05 16:52:41,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 1 states have call successors, (107), 2 states have call predecessors, (107), 2 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 16:52:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1118 transitions. [2025-02-05 16:52:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-02-05 16:52:41,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:41,935 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 20, 20, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:52:41,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:52:42,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:42,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:42,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:42,140 INFO L85 PathProgramCache]: Analyzing trace with hash 495526237, now seen corresponding path program 2 times [2025-02-05 16:52:42,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:42,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30656832] [2025-02-05 16:52:42,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:52:42,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:42,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 384 statements into 2 equivalence classes. [2025-02-05 16:52:42,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 384 statements. [2025-02-05 16:52:42,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:52:42,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5799 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5797 trivial. 0 not checked. [2025-02-05 16:52:43,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:43,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30656832] [2025-02-05 16:52:43,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30656832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:43,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:43,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:52:43,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949196944] [2025-02-05 16:52:43,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:43,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:52:43,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:43,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:52:43,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:52:43,114 INFO L87 Difference]: Start difference. First operand 702 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-02-05 16:52:43,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:43,160 INFO L93 Difference]: Finished difference Result 1338 states and 2156 transitions. [2025-02-05 16:52:43,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:52:43,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 384 [2025-02-05 16:52:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:43,167 INFO L225 Difference]: With dead ends: 1338 [2025-02-05 16:52:43,167 INFO L226 Difference]: Without dead ends: 702 [2025-02-05 16:52:43,170 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-02-05 16:52:43,171 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1064 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-02-05 16:52:43,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1064 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:52:43,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-02-05 16:52:43,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-02-05 16:52:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 421 states have (on average 1.4014251781472684) internal successors, (590), 424 states have internal predecessors, (590), 261 states have call successors, (261), 19 states have call predecessors, (261), 19 states have return successors, (266), 260 states have call predecessors, (266), 259 states have call successors, (266) [2025-02-05 16:52:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1117 transitions. [2025-02-05 16:52:43,245 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1117 transitions. Word has length 384 [2025-02-05 16:52:43,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:43,245 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1117 transitions. [2025-02-05 16:52:43,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-02-05 16:52:43,246 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1117 transitions. [2025-02-05 16:52:43,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-02-05 16:52:43,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:43,252 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 20, 20, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:52:43,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:52:43,252 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:43,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:43,253 INFO L85 PathProgramCache]: Analyzing trace with hash 9108222, now seen corresponding path program 1 times [2025-02-05 16:52:43,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:43,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694896697] [2025-02-05 16:52:43,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:43,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-05 16:52:43,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-05 16:52:43,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:43,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6007 backedges. 125 proven. 55 refuted. 0 times theorem prover too weak. 5827 trivial. 0 not checked. [2025-02-05 16:52:44,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:44,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694896697] [2025-02-05 16:52:44,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694896697] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:44,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680703381] [2025-02-05 16:52:44,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:44,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:44,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:44,676 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:44,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:52:45,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-05 16:52:45,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-05 16:52:45,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:45,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:45,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 3141 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 16:52:45,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:45,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6007 backedges. 123 proven. 55 refuted. 0 times theorem prover too weak. 5829 trivial. 0 not checked. [2025-02-05 16:52:45,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:52:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6007 backedges. 125 proven. 55 refuted. 0 times theorem prover too weak. 5827 trivial. 0 not checked. [2025-02-05 16:52:46,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680703381] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:52:46,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:52:46,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-02-05 16:52:46,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282005606] [2025-02-05 16:52:46,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:52:46,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 16:52:46,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:46,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 16:52:46,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:52:46,555 INFO L87 Difference]: Start difference. First operand 702 states and 1117 transitions. Second operand has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 2 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-02-05 16:52:46,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:46,886 INFO L93 Difference]: Finished difference Result 1430 states and 2299 transitions. [2025-02-05 16:52:46,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 16:52:46,888 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 2 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) Word has length 405 [2025-02-05 16:52:46,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:46,893 INFO L225 Difference]: With dead ends: 1430 [2025-02-05 16:52:46,893 INFO L226 Difference]: Without dead ends: 742 [2025-02-05 16:52:46,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 798 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:52:46,896 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 0 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2108 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:46,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2108 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:52:46,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-02-05 16:52:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2025-02-05 16:52:46,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 461 states have (on average 1.3665943600867678) internal successors, (630), 464 states have internal predecessors, (630), 261 states have call successors, (261), 19 states have call predecessors, (261), 19 states have return successors, (266), 260 states have call predecessors, (266), 259 states have call successors, (266) [2025-02-05 16:52:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1157 transitions. [2025-02-05 16:52:46,933 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1157 transitions. Word has length 405 [2025-02-05 16:52:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:46,933 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1157 transitions. [2025-02-05 16:52:46,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 2 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-02-05 16:52:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1157 transitions. [2025-02-05 16:52:46,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-02-05 16:52:46,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:46,939 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:52:46,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:52:47,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:47,140 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:47,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:47,140 INFO L85 PathProgramCache]: Analyzing trace with hash -457775888, now seen corresponding path program 1 times [2025-02-05 16:52:47,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:47,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251909272] [2025-02-05 16:52:47,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:47,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:47,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-02-05 16:52:47,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-02-05 16:52:47,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:47,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7267 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7265 trivial. 0 not checked. [2025-02-05 16:52:48,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:48,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251909272] [2025-02-05 16:52:48,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251909272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:48,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:48,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:52:48,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207601137] [2025-02-05 16:52:48,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:48,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:52:48,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:48,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:52:48,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:48,594 INFO L87 Difference]: Start difference. First operand 742 states and 1157 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) [2025-02-05 16:52:52,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:53,490 INFO L93 Difference]: Finished difference Result 2040 states and 3289 transitions. [2025-02-05 16:52:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:52:53,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) Word has length 445 [2025-02-05 16:52:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:53,500 INFO L225 Difference]: With dead ends: 2040 [2025-02-05 16:52:53,500 INFO L226 Difference]: Without dead ends: 1397 [2025-02-05 16:52:53,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:52:53,505 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 604 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1969 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:53,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1969 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 219 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-02-05 16:52:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2025-02-05 16:52:53,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 748. [2025-02-05 16:52:53,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 465 states have (on average 1.3634408602150538) internal successors, (634), 470 states have internal predecessors, (634), 261 states have call successors, (261), 19 states have call predecessors, (261), 21 states have return successors, (272), 260 states have call predecessors, (272), 259 states have call successors, (272) [2025-02-05 16:52:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1167 transitions. [2025-02-05 16:52:53,575 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1167 transitions. Word has length 445 [2025-02-05 16:52:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:53,576 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1167 transitions. [2025-02-05 16:52:53,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) [2025-02-05 16:52:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1167 transitions. [2025-02-05 16:52:53,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-02-05 16:52:53,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:53,580 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:52:53,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:52:53,581 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:53,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:53,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2058133118, now seen corresponding path program 2 times [2025-02-05 16:52:53,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:53,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568409161] [2025-02-05 16:52:53,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:52:53,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:53,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 445 statements into 2 equivalence classes. [2025-02-05 16:52:53,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 445 statements. [2025-02-05 16:52:53,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:52:53,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7267 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7265 trivial. 0 not checked. [2025-02-05 16:52:54,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:54,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568409161] [2025-02-05 16:52:54,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568409161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:54,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:54,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:52:54,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532953707] [2025-02-05 16:52:54,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:54,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:52:54,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:54,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:52:54,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:54,403 INFO L87 Difference]: Start difference. First operand 748 states and 1167 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) [2025-02-05 16:52:58,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:02,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:03,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:03,793 INFO L93 Difference]: Finished difference Result 2058 states and 3319 transitions. [2025-02-05 16:53:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:53:03,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) Word has length 445 [2025-02-05 16:53:03,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:03,803 INFO L225 Difference]: With dead ends: 2058 [2025-02-05 16:53:03,803 INFO L226 Difference]: Without dead ends: 1409 [2025-02-05 16:53:03,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:53:03,807 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 684 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 92 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:03,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1674 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 439 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2025-02-05 16:53:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2025-02-05 16:53:03,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 748. [2025-02-05 16:53:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 465 states have (on average 1.3634408602150538) internal successors, (634), 470 states have internal predecessors, (634), 261 states have call successors, (261), 19 states have call predecessors, (261), 21 states have return successors, (272), 260 states have call predecessors, (272), 259 states have call successors, (272) [2025-02-05 16:53:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1167 transitions. [2025-02-05 16:53:03,870 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1167 transitions. Word has length 445 [2025-02-05 16:53:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:03,870 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1167 transitions. [2025-02-05 16:53:03,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) [2025-02-05 16:53:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1167 transitions. [2025-02-05 16:53:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-02-05 16:53:03,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:03,875 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:53:03,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:53:03,875 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:03,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:03,876 INFO L85 PathProgramCache]: Analyzing trace with hash -656570457, now seen corresponding path program 1 times [2025-02-05 16:53:03,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:03,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049317281] [2025-02-05 16:53:03,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:03,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:04,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-02-05 16:53:04,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-02-05 16:53:04,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:04,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7267 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7265 trivial. 0 not checked. [2025-02-05 16:53:05,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:05,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049317281] [2025-02-05 16:53:05,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049317281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:05,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:05,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:53:05,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021627069] [2025-02-05 16:53:05,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:05,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:53:05,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:05,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:53:05,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:53:05,742 INFO L87 Difference]: Start difference. First operand 748 states and 1167 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (57), 3 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-02-05 16:53:07,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:07,522 INFO L93 Difference]: Finished difference Result 783 states and 1214 transitions. [2025-02-05 16:53:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:53:07,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (57), 3 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 444 [2025-02-05 16:53:07,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:07,528 INFO L225 Difference]: With dead ends: 783 [2025-02-05 16:53:07,528 INFO L226 Difference]: Without dead ends: 781 [2025-02-05 16:53:07,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:53:07,530 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 790 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:07,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1948 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:53:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-02-05 16:53:07,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 775. [2025-02-05 16:53:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 483 states have (on average 1.3581780538302277) internal successors, (656), 488 states have internal predecessors, (656), 266 states have call successors, (266), 20 states have call predecessors, (266), 25 states have return successors, (284), 268 states have call predecessors, (284), 264 states have call successors, (284) [2025-02-05 16:53:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1206 transitions. [2025-02-05 16:53:07,578 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1206 transitions. Word has length 444 [2025-02-05 16:53:07,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:07,579 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1206 transitions. [2025-02-05 16:53:07,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (57), 3 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-02-05 16:53:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1206 transitions. [2025-02-05 16:53:07,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-02-05 16:53:07,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:07,585 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:53:07,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:53:07,585 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:07,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:07,586 INFO L85 PathProgramCache]: Analyzing trace with hash 201309244, now seen corresponding path program 1 times [2025-02-05 16:53:07,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:07,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069084648] [2025-02-05 16:53:07,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:07,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:08,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-02-05 16:53:08,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-02-05 16:53:08,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:08,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7273 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7269 trivial. 0 not checked. [2025-02-05 16:53:09,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:09,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069084648] [2025-02-05 16:53:09,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069084648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:09,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:09,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:53:09,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804655748] [2025-02-05 16:53:09,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:09,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:53:09,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:09,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:53:09,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:53:09,616 INFO L87 Difference]: Start difference. First operand 775 states and 1206 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 4 states have call successors, (57) [2025-02-05 16:53:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:11,228 INFO L93 Difference]: Finished difference Result 784 states and 1213 transitions. [2025-02-05 16:53:11,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:53:11,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 4 states have call successors, (57) Word has length 449 [2025-02-05 16:53:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:11,243 INFO L225 Difference]: With dead ends: 784 [2025-02-05 16:53:11,243 INFO L226 Difference]: Without dead ends: 782 [2025-02-05 16:53:11,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:53:11,245 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 903 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 2164 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:11,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 2164 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 16:53:11,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-02-05 16:53:11,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 779. [2025-02-05 16:53:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 486 states have (on average 1.3559670781893005) internal successors, (659), 491 states have internal predecessors, (659), 266 states have call successors, (266), 21 states have call predecessors, (266), 26 states have return successors, (284), 268 states have call predecessors, (284), 264 states have call successors, (284) [2025-02-05 16:53:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1209 transitions. [2025-02-05 16:53:11,333 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1209 transitions. Word has length 449 [2025-02-05 16:53:11,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:11,334 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1209 transitions. [2025-02-05 16:53:11,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 4 states have call successors, (57) [2025-02-05 16:53:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1209 transitions. [2025-02-05 16:53:11,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-02-05 16:53:11,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:11,340 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:53:11,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:53:11,340 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:11,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:11,340 INFO L85 PathProgramCache]: Analyzing trace with hash 943916295, now seen corresponding path program 1 times [2025-02-05 16:53:11,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:11,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545876231] [2025-02-05 16:53:11,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:11,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:11,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-02-05 16:53:12,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-02-05 16:53:12,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:12,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7283 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7277 trivial. 0 not checked. [2025-02-05 16:53:13,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:13,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545876231] [2025-02-05 16:53:13,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545876231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:13,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:13,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:53:13,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440533660] [2025-02-05 16:53:13,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:13,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:53:13,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:13,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:53:13,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:53:13,286 INFO L87 Difference]: Start difference. First operand 779 states and 1209 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (59), 3 states have call predecessors, (59), 2 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-02-05 16:53:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:14,922 INFO L93 Difference]: Finished difference Result 788 states and 1216 transitions. [2025-02-05 16:53:14,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:53:14,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (59), 3 states have call predecessors, (59), 2 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) Word has length 454 [2025-02-05 16:53:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:14,927 INFO L225 Difference]: With dead ends: 788 [2025-02-05 16:53:14,928 INFO L226 Difference]: Without dead ends: 786 [2025-02-05 16:53:14,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:53:14,929 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 788 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:14,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 1945 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 16:53:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-02-05 16:53:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 783. [2025-02-05 16:53:14,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 489 states have (on average 1.3537832310838447) internal successors, (662), 494 states have internal predecessors, (662), 266 states have call successors, (266), 22 states have call predecessors, (266), 27 states have return successors, (284), 268 states have call predecessors, (284), 264 states have call successors, (284) [2025-02-05 16:53:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1212 transitions. [2025-02-05 16:53:14,988 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1212 transitions. Word has length 454 [2025-02-05 16:53:14,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:14,989 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1212 transitions. [2025-02-05 16:53:14,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (59), 3 states have call predecessors, (59), 2 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-02-05 16:53:14,989 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1212 transitions. [2025-02-05 16:53:14,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-02-05 16:53:14,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:14,998 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:53:14,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:53:14,999 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:14,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1964469084, now seen corresponding path program 1 times [2025-02-05 16:53:15,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:15,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403414822] [2025-02-05 16:53:15,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:15,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:15,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-02-05 16:53:15,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-02-05 16:53:15,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:15,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7297 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7289 trivial. 0 not checked. [2025-02-05 16:53:17,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:17,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403414822] [2025-02-05 16:53:17,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403414822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:17,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:17,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:53:17,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749484372] [2025-02-05 16:53:17,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:17,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:53:17,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:17,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:53:17,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:53:17,188 INFO L87 Difference]: Start difference. First operand 783 states and 1212 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (60), 3 states have call predecessors, (60), 2 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-02-05 16:53:18,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:18,922 INFO L93 Difference]: Finished difference Result 792 states and 1219 transitions. [2025-02-05 16:53:18,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:53:18,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (60), 3 states have call predecessors, (60), 2 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 459 [2025-02-05 16:53:18,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:18,933 INFO L225 Difference]: With dead ends: 792 [2025-02-05 16:53:18,936 INFO L226 Difference]: Without dead ends: 790 [2025-02-05 16:53:18,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:53:18,938 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 594 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:18,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 2041 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:53:18,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-02-05 16:53:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 787. [2025-02-05 16:53:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 492 states have (on average 1.3516260162601625) internal successors, (665), 497 states have internal predecessors, (665), 266 states have call successors, (266), 23 states have call predecessors, (266), 28 states have return successors, (284), 268 states have call predecessors, (284), 264 states have call successors, (284) [2025-02-05 16:53:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1215 transitions. [2025-02-05 16:53:18,995 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1215 transitions. Word has length 459 [2025-02-05 16:53:18,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:18,996 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1215 transitions. [2025-02-05 16:53:18,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (60), 3 states have call predecessors, (60), 2 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-02-05 16:53:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1215 transitions. [2025-02-05 16:53:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-02-05 16:53:19,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:19,003 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 6, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:53:19,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:53:19,003 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:19,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:19,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1140745625, now seen corresponding path program 1 times [2025-02-05 16:53:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:19,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441836280] [2025-02-05 16:53:19,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:19,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:19,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-02-05 16:53:20,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-02-05 16:53:20,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:20,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7305 trivial. 0 not checked. [2025-02-05 16:53:21,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:21,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441836280] [2025-02-05 16:53:21,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441836280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:21,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:21,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:53:21,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708517099] [2025-02-05 16:53:21,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:21,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:53:21,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:21,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:53:21,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:53:21,265 INFO L87 Difference]: Start difference. First operand 787 states and 1215 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (61), 3 states have call predecessors, (61), 2 states have return successors, (60), 3 states have call predecessors, (60), 4 states have call successors, (60) [2025-02-05 16:53:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:22,908 INFO L93 Difference]: Finished difference Result 796 states and 1222 transitions. [2025-02-05 16:53:22,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:53:22,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (61), 3 states have call predecessors, (61), 2 states have return successors, (60), 3 states have call predecessors, (60), 4 states have call successors, (60) Word has length 464 [2025-02-05 16:53:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:22,918 INFO L225 Difference]: With dead ends: 796 [2025-02-05 16:53:22,919 INFO L226 Difference]: Without dead ends: 792 [2025-02-05 16:53:22,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:53:22,922 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 903 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 2174 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:22,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 2174 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 16:53:22,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-02-05 16:53:23,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 789. [2025-02-05 16:53:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 494 states have (on average 1.3481781376518218) internal successors, (666), 498 states have internal predecessors, (666), 266 states have call successors, (266), 24 states have call predecessors, (266), 28 states have return successors, (284), 268 states have call predecessors, (284), 264 states have call successors, (284) [2025-02-05 16:53:23,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1216 transitions. [2025-02-05 16:53:23,011 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1216 transitions. Word has length 464 [2025-02-05 16:53:23,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:23,012 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1216 transitions. [2025-02-05 16:53:23,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (61), 3 states have call predecessors, (61), 2 states have return successors, (60), 3 states have call predecessors, (60), 4 states have call successors, (60) [2025-02-05 16:53:23,012 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1216 transitions. [2025-02-05 16:53:23,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-02-05 16:53:23,016 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:23,016 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 7, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:53:23,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:53:23,017 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:23,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:23,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2110063228, now seen corresponding path program 1 times [2025-02-05 16:53:23,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:23,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645535333] [2025-02-05 16:53:23,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:23,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:23,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-02-05 16:53:23,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-02-05 16:53:23,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:23,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7337 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7325 trivial. 0 not checked. [2025-02-05 16:53:24,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:24,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645535333] [2025-02-05 16:53:24,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645535333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:24,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:24,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:53:24,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665264978] [2025-02-05 16:53:24,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:24,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:53:24,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:24,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:53:24,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:53:24,370 INFO L87 Difference]: Start difference. First operand 789 states and 1216 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-02-05 16:53:25,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:25,675 INFO L93 Difference]: Finished difference Result 792 states and 1218 transitions. [2025-02-05 16:53:25,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:53:25,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) Word has length 469 [2025-02-05 16:53:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:25,681 INFO L225 Difference]: With dead ends: 792 [2025-02-05 16:53:25,681 INFO L226 Difference]: Without dead ends: 650 [2025-02-05 16:53:25,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:53:25,682 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 780 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1969 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:25,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1969 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:53:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-02-05 16:53:25,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 649. [2025-02-05 16:53:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 419 states have (on average 1.405727923627685) internal successors, (589), 424 states have internal predecessors, (589), 207 states have call successors, (207), 17 states have call predecessors, (207), 22 states have return successors, (224), 209 states have call predecessors, (224), 206 states have call successors, (224) [2025-02-05 16:53:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1020 transitions. [2025-02-05 16:53:25,730 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1020 transitions. Word has length 469 [2025-02-05 16:53:25,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:25,731 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 1020 transitions. [2025-02-05 16:53:25,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-02-05 16:53:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1020 transitions. [2025-02-05 16:53:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-02-05 16:53:25,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:25,737 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 40, 40, 6, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:53:25,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:53:25,737 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:25,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1611683192, now seen corresponding path program 1 times [2025-02-05 16:53:25,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:25,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565192923] [2025-02-05 16:53:25,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:25,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:26,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-02-05 16:53:26,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-02-05 16:53:26,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:26,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:27,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8187 trivial. 0 not checked. [2025-02-05 16:53:27,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:27,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565192923] [2025-02-05 16:53:27,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565192923] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:53:27,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572641199] [2025-02-05 16:53:27,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:27,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:27,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:27,242 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:53:27,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:53:28,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-02-05 16:53:28,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-02-05 16:53:28,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:28,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:28,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 4183 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 16:53:28,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:53:29,512 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 25 treesize of output 13 [2025-02-05 16:53:29,534 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 9 treesize of output 3 [2025-02-05 16:53:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 1040 proven. 5 refuted. 0 times theorem prover too weak. 7147 trivial. 0 not checked. [2025-02-05 16:53:29,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:53:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8187 trivial. 0 not checked. [2025-02-05 16:53:31,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572641199] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:53:31,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:53:31,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-05 16:53:31,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035490791] [2025-02-05 16:53:31,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:53:31,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:53:31,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:31,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:53:31,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:53:31,545 INFO L87 Difference]: Start difference. First operand 649 states and 1020 transitions. Second operand has 13 states, 10 states have (on average 16.6) internal successors, (166), 13 states have internal predecessors, (166), 13 states have call successors, (127), 5 states have call predecessors, (127), 7 states have return successors, (126), 10 states have call predecessors, (126), 13 states have call successors, (126) [2025-02-05 16:53:35,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:39,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []