./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 551b0097 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-?-551b009-m [2025-01-09 05:00:53,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:00:53,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:00:53,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:00:53,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:00:53,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:00:53,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:00:53,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:00:53,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:00:53,558 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:00:53,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:00:53,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:00:53,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:00:53,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:00:53,558 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:00:53,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:00:53,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:00:53,558 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:00:53,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:00:53,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:00:53,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:00:53,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:00:53,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:00:53,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:00:53,559 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:00:53,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:00:53,559 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:00:53,559 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:00:53,559 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:00:53,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:00:53,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:00:53,559 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:00:53,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:00:53,559 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:00:53,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:00:53,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:00:53,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:00:53,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:00:53,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:00:53,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:00:53,560 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:00:53,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:00:53,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:00:53,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:00:53,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:00:53,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:00:53,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:00:53,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:00:53,560 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-01-09 05:00:53,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:00:53,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:00:53,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:00:53,815 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:00:53,815 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:00:53,818 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-01-09 05:00:55,013 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48ab589b4/ddf8782f08994a4aa619de3db6581a93/FLAG93da9f1f3 [2025-01-09 05:00:55,295 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:00:55,296 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_queue-1.i [2025-01-09 05:00:55,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48ab589b4/ddf8782f08994a4aa619de3db6581a93/FLAG93da9f1f3 [2025-01-09 05:00:55,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48ab589b4/ddf8782f08994a4aa619de3db6581a93 [2025-01-09 05:00:55,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:00:55,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:00:55,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:00:55,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:00:55,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:00:55,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:00:55" (1/1) ... [2025-01-09 05:00:55,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@129e3707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:55, skipping insertion in model container [2025-01-09 05:00:55,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:00:55" (1/1) ... [2025-01-09 05:00:55,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:00:55,897 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-01-09 05:00:56,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:00:56,025 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:00:56,063 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-01-09 05:00:56,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:00:56,218 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:00:56,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:56 WrapperNode [2025-01-09 05:00:56,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:00:56,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:00:56,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:00:56,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:00:56,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:56" (1/1) ... [2025-01-09 05:00:56,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:56" (1/1) ... [2025-01-09 05:00:56,330 INFO L138 Inliner]: procedures = 251, calls = 629, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1399 [2025-01-09 05:00:56,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:00:56,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:00:56,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:00:56,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:00:56,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:56" (1/1) ... [2025-01-09 05:00:56,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:56" (1/1) ... [2025-01-09 05:00:56,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:56" (1/1) ... [2025-01-09 05:00:56,389 INFO L175 MemorySlicer]: Split 397 memory accesses to 20 slices as follows [2, 3, 3, 8, 8, 8, 8, 20, 12, 82, 41, 8, 8, 3, 7, 6, 50, 7, 0, 113]. 28 percent of accesses are in the largest equivalence class. The 117 initializations are split as follows [2, 0, 0, 3, 3, 3, 2, 6, 6, 40, 0, 2, 2, 0, 0, 2, 0, 0, 0, 46]. The 94 writes are split as follows [0, 1, 1, 2, 2, 2, 3, 8, 3, 21, 1, 4, 4, 1, 1, 2, 4, 1, 0, 33]. [2025-01-09 05:00:56,389 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:56" (1/1) ... [2025-01-09 05:00:56,389 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:56" (1/1) ... [2025-01-09 05:00:56,433 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:56" (1/1) ... [2025-01-09 05:00:56,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:56" (1/1) ... [2025-01-09 05:00:56,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:56" (1/1) ... [2025-01-09 05:00:56,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:56" (1/1) ... [2025-01-09 05:00:56,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:56" (1/1) ... [2025-01-09 05:00:56,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:00:56,477 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:00:56,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:00:56,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:00:56,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:56" (1/1) ... [2025-01-09 05:00:56,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:00:56,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:00:56,506 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-01-09 05:00:56,508 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-01-09 05:00:56,524 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 05:00:56,524 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 05:00:56,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 05:00:56,524 INFO L130 BoogieDeclarations]: Found specification of procedure empty [2025-01-09 05:00:56,525 INFO L138 BoogieDeclarations]: Found implementation of procedure empty [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-01-09 05:00:56,525 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 05:00:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-01-09 05:00:56,526 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 05:00:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 05:00:56,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 05:00:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-01-09 05:00:56,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-01-09 05:00:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-01-09 05:00:56,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-01-09 05:00:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:00:56,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:00:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-01-09 05:00:56,530 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-01-09 05:00:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:00:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 05:00:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 05:00:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 05:00:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 05:00:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 05:00:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 05:00:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 05:00:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 05:00:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 05:00:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 05:00:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 05:00:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 05:00:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 05:00:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 05:00:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 05:00:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 05:00:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 05:00:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 05:00:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 05:00:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:00:56,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:00:56,826 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:00:56,827 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:00:56,936 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:00:56,938 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:00:56,939 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: 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-01-09 05:00:56,939 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: 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-01-09 05:00:57,407 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093: SUMMARY for call __CS_cs(); srcloc: null [2025-01-09 05:00:57,410 INFO L727 $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-01-09 05:00:57,411 INFO L727 $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-01-09 05:00:57,411 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129: SUMMARY for call __CS_cs(); srcloc: null [2025-01-09 05:00:57,411 INFO L727 $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-01-09 05:00:57,411 INFO L727 $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-01-09 05:00:57,411 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##80: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:00:57,411 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: 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-01-09 05:00:57,411 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:00:57,411 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: 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-01-09 05:00:57,411 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:00:57,412 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##79: 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-01-09 05:00:57,412 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:00:57,412 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:00:57,412 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##143: 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-01-09 05:00:57,412 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: 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-01-09 05:00:57,412 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:00:57,412 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: 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-01-09 05:00:57,412 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:00:57,412 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##160: 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-01-09 05:00:57,412 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:00:57,412 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: 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-01-09 05:01:02,259 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-01-09 05:01:02,259 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:01:02,273 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:01:02,273 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 05:01:02,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:01:02 BoogieIcfgContainer [2025-01-09 05:01:02,273 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:01:02,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:01:02,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:01:02,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:01:02,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:00:55" (1/3) ... [2025-01-09 05:01:02,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24625d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:01:02, skipping insertion in model container [2025-01-09 05:01:02,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:56" (2/3) ... [2025-01-09 05:01:02,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24625d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:01:02, skipping insertion in model container [2025-01-09 05:01:02,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:01:02" (3/3) ... [2025-01-09 05:01:02,280 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_queue-1.i [2025-01-09 05:01:02,290 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:01:02,293 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_queue-1.i that has 10 procedures, 337 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 05:01:02,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:01:02,355 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;@4ab1bdf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:01:02,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 05:01:02,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 337 states, 194 states have (on average 1.4639175257731958) internal successors, (284), 196 states have internal predecessors, (284), 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-01-09 05:01:02,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 05:01:02,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:02,389 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-01-09 05:01:02,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:02,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:02,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1058909326, now seen corresponding path program 1 times [2025-01-09 05:01:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:02,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143707773] [2025-01-09 05:01:02,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:02,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 05:01:03,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 05:01:03,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:03,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 05:01:03,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:03,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143707773] [2025-01-09 05:01:03,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143707773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:03,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:03,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:01:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953950072] [2025-01-09 05:01:03,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:03,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:01:03,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:03,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:01:03,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:01:03,717 INFO L87 Difference]: Start difference. First operand has 337 states, 194 states have (on average 1.4639175257731958) internal successors, (284), 196 states have internal predecessors, (284), 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-01-09 05:01:07,804 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-01-09 05:01:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:07,933 INFO L93 Difference]: Finished difference Result 669 states and 1214 transitions. [2025-01-09 05:01:07,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:01:07,935 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-01-09 05:01:07,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:07,943 INFO L225 Difference]: With dead ends: 669 [2025-01-09 05:01:07,944 INFO L226 Difference]: Without dead ends: 334 [2025-01-09 05:01:07,948 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-01-09 05:01:07,950 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 6 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1067 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-01-09 05:01:07,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1067 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 05:01:07,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-01-09 05:01:08,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2025-01-09 05:01:08,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 190 states have (on average 1.4526315789473685) internal successors, (276), 192 states have internal predecessors, (276), 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-01-09 05:01:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 537 transitions. [2025-01-09 05:01:08,021 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 537 transitions. Word has length 325 [2025-01-09 05:01:08,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:08,021 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 537 transitions. [2025-01-09 05:01:08,021 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-01-09 05:01:08,023 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 537 transitions. [2025-01-09 05:01:08,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-01-09 05:01:08,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:08,032 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-01-09 05:01:08,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:01:08,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:08,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:08,033 INFO L85 PathProgramCache]: Analyzing trace with hash -855788990, now seen corresponding path program 1 times [2025-01-09 05:01:08,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:08,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310370380] [2025-01-09 05:01:08,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:08,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:08,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-09 05:01:08,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-09 05:01:08,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:08,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5305 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 05:01:08,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:08,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310370380] [2025-01-09 05:01:08,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310370380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:08,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:08,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:01:08,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304801068] [2025-01-09 05:01:08,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:08,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:01:08,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:08,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:01:08,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:01:08,689 INFO L87 Difference]: Start difference. First operand 331 states and 537 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-01-09 05:01:08,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:08,786 INFO L93 Difference]: Finished difference Result 662 states and 1077 transitions. [2025-01-09 05:01:08,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:01:08,788 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-01-09 05:01:08,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:08,794 INFO L225 Difference]: With dead ends: 662 [2025-01-09 05:01:08,794 INFO L226 Difference]: Without dead ends: 334 [2025-01-09 05:01:08,797 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-01-09 05:01:08,798 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1061 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:08,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1061 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:01:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-01-09 05:01:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-01-09 05:01:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 193 states have (on average 1.4455958549222798) internal successors, (279), 195 states have internal predecessors, (279), 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-01-09 05:01:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 540 transitions. [2025-01-09 05:01:08,836 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 540 transitions. Word has length 329 [2025-01-09 05:01:08,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:08,836 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 540 transitions. [2025-01-09 05:01:08,836 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-01-09 05:01:08,836 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 540 transitions. [2025-01-09 05:01:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-01-09 05:01:08,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:08,844 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-01-09 05:01:08,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:01:08,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:08,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:08,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1929958509, now seen corresponding path program 1 times [2025-01-09 05:01:08,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:08,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905053079] [2025-01-09 05:01:08,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:08,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:09,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-09 05:01:09,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-09 05:01:09,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:09,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5308 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2025-01-09 05:01:09,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:09,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905053079] [2025-01-09 05:01:09,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905053079] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:09,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133326444] [2025-01-09 05:01:09,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:09,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:09,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:09,706 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-01-09 05:01:09,707 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-01-09 05:01:10,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-09 05:01:10,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-09 05:01:10,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:10,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:10,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:01:10,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5308 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2025-01-09 05:01:10,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5308 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2025-01-09 05:01:11,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133326444] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:11,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:11,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 05:01:11,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325762203] [2025-01-09 05:01:11,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:11,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:01:11,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:11,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:01:11,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:01:11,280 INFO L87 Difference]: Start difference. First operand 334 states and 540 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-01-09 05:01:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:11,410 INFO L93 Difference]: Finished difference Result 672 states and 1091 transitions. [2025-01-09 05:01:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:01:11,413 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-01-09 05:01:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:11,419 INFO L225 Difference]: With dead ends: 672 [2025-01-09 05:01:11,419 INFO L226 Difference]: Without dead ends: 341 [2025-01-09 05:01:11,421 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-01-09 05:01:11,421 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 0 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:11,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1060 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:01:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-01-09 05:01:11,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-01-09 05:01:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 200 states have (on average 1.43) internal successors, (286), 202 states have internal predecessors, (286), 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-01-09 05:01:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 547 transitions. [2025-01-09 05:01:11,441 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 547 transitions. Word has length 332 [2025-01-09 05:01:11,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:11,441 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 547 transitions. [2025-01-09 05:01:11,441 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-01-09 05:01:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 547 transitions. [2025-01-09 05:01:11,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-01-09 05:01:11,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:11,445 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-01-09 05:01:11,456 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-01-09 05:01:11,650 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-01-09 05:01:11,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:11,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:11,651 INFO L85 PathProgramCache]: Analyzing trace with hash 258498466, now seen corresponding path program 2 times [2025-01-09 05:01:11,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:11,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513911042] [2025-01-09 05:01:11,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:01:11,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:11,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 339 statements into 2 equivalence classes. [2025-01-09 05:01:12,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 339 statements. [2025-01-09 05:01:12,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:01:12,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5328 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5328 trivial. 0 not checked. [2025-01-09 05:01:12,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:12,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513911042] [2025-01-09 05:01:12,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513911042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:12,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:12,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:01:12,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021964935] [2025-01-09 05:01:12,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:12,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:01:12,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:12,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:01:12,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:01:12,516 INFO L87 Difference]: Start difference. First operand 341 states and 547 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-01-09 05:01:12,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:12,766 INFO L93 Difference]: Finished difference Result 669 states and 1081 transitions. [2025-01-09 05:01:12,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:01:12,767 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-01-09 05:01:12,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:12,773 INFO L225 Difference]: With dead ends: 669 [2025-01-09 05:01:12,773 INFO L226 Difference]: Without dead ends: 667 [2025-01-09 05:01:12,774 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-01-09 05:01:12,774 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 417 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 2150 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:12,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 2150 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:01:12,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-01-09 05:01:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 664. [2025-01-09 05:01:12,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 383 states have (on average 1.4360313315926894) internal successors, (550), 386 states have internal predecessors, (550), 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-01-09 05:01:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1077 transitions. [2025-01-09 05:01:12,841 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1077 transitions. Word has length 339 [2025-01-09 05:01:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:12,844 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 1077 transitions. [2025-01-09 05:01:12,844 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-01-09 05:01:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1077 transitions. [2025-01-09 05:01:12,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-01-09 05:01:12,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:12,856 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-01-09 05:01:12,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:01:12,857 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:12,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:12,858 INFO L85 PathProgramCache]: Analyzing trace with hash -859227233, now seen corresponding path program 1 times [2025-01-09 05:01:12,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:12,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679735962] [2025-01-09 05:01:12,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:12,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:13,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-09 05:01:13,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-09 05:01:13,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:13,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5330 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2025-01-09 05:01:13,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:13,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679735962] [2025-01-09 05:01:13,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679735962] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:13,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217606115] [2025-01-09 05:01:13,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:13,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:13,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:13,431 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-01-09 05:01:13,433 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-01-09 05:01:14,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-09 05:01:14,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-09 05:01:14,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:14,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:14,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 2226 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 05:01:14,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5330 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 5319 trivial. 0 not checked. [2025-01-09 05:01:14,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5330 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 5317 trivial. 0 not checked. [2025-01-09 05:01:15,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217606115] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:15,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:15,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-01-09 05:01:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405569895] [2025-01-09 05:01:15,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:15,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 05:01:15,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:15,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 05:01:15,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-01-09 05:01:15,044 INFO L87 Difference]: Start difference. First operand 664 states and 1077 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-01-09 05:01:19,922 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-01-09 05:01:23,940 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-01-09 05:01:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:23,968 INFO L93 Difference]: Finished difference Result 1365 states and 2221 transitions. [2025-01-09 05:01:23,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 05:01:23,979 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-01-09 05:01:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:23,984 INFO L225 Difference]: With dead ends: 1365 [2025-01-09 05:01:23,984 INFO L226 Difference]: Without dead ends: 704 [2025-01-09 05:01:23,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 678 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=396, Invalid=726, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 05:01:23,988 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 29 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 133 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:23,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1586 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-01-09 05:01:23,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-01-09 05:01:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2025-01-09 05:01:24,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 423 states have (on average 1.4018912529550827) internal successors, (593), 426 states have internal predecessors, (593), 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-01-09 05:01:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1120 transitions. [2025-01-09 05:01:24,036 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1120 transitions. Word has length 344 [2025-01-09 05:01:24,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:24,037 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 1120 transitions. [2025-01-09 05:01:24,037 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-01-09 05:01:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1120 transitions. [2025-01-09 05:01:24,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-01-09 05:01:24,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:24,044 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-01-09 05:01:24,055 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-01-09 05:01:24,245 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-01-09 05:01:24,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:24,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:24,246 INFO L85 PathProgramCache]: Analyzing trace with hash 655922963, now seen corresponding path program 2 times [2025-01-09 05:01:24,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:24,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071077409] [2025-01-09 05:01:24,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:01:24,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:24,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 384 statements into 2 equivalence classes. [2025-01-09 05:01:24,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 384 statements. [2025-01-09 05:01:24,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:01:24,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5799 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5797 trivial. 0 not checked. [2025-01-09 05:01:24,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:24,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071077409] [2025-01-09 05:01:24,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071077409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:24,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:24,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:01:24,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480285157] [2025-01-09 05:01:24,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:24,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:01:24,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:24,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:01:24,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:01:24,959 INFO L87 Difference]: Start difference. First operand 704 states and 1120 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-01-09 05:01:24,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:24,994 INFO L93 Difference]: Finished difference Result 1342 states and 2160 transitions. [2025-01-09 05:01:24,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:01:24,994 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-01-09 05:01:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:24,999 INFO L225 Difference]: With dead ends: 1342 [2025-01-09 05:01:24,999 INFO L226 Difference]: Without dead ends: 704 [2025-01-09 05:01:25,002 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-01-09 05:01:25,003 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 0 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1066 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-01-09 05:01:25,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1066 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:01:25,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-01-09 05:01:25,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2025-01-09 05:01:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 423 states have (on average 1.3995271867612293) internal successors, (592), 426 states have internal predecessors, (592), 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-01-09 05:01:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1119 transitions. [2025-01-09 05:01:25,043 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1119 transitions. Word has length 384 [2025-01-09 05:01:25,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:25,043 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 1119 transitions. [2025-01-09 05:01:25,044 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-01-09 05:01:25,044 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1119 transitions. [2025-01-09 05:01:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-01-09 05:01:25,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:25,051 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-01-09 05:01:25,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:01:25,051 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:25,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:25,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1375293727, now seen corresponding path program 1 times [2025-01-09 05:01:25,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:25,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025940900] [2025-01-09 05:01:25,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:25,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:25,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-01-09 05:01:25,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-01-09 05:01:25,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:25,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6007 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6005 trivial. 0 not checked. [2025-01-09 05:01:26,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:26,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025940900] [2025-01-09 05:01:26,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025940900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:26,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:26,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:01:26,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232375009] [2025-01-09 05:01:26,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:26,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:01:26,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:26,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:01:26,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:01:26,612 INFO L87 Difference]: Start difference. First operand 704 states and 1119 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-01-09 05:01:30,650 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-01-09 05:01:34,672 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-01-09 05:01:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:36,236 INFO L93 Difference]: Finished difference Result 2006 states and 3255 transitions. [2025-01-09 05:01:36,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:01:36,237 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 405 [2025-01-09 05:01:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:36,247 INFO L225 Difference]: With dead ends: 2006 [2025-01-09 05:01:36,248 INFO L226 Difference]: Without dead ends: 1361 [2025-01-09 05:01:36,251 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-01-09 05:01:36,252 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 685 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 92 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1663 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.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:36,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1663 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 439 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2025-01-09 05:01:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2025-01-09 05:01:36,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 710. [2025-01-09 05:01:36,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 427 states have (on average 1.395784543325527) internal successors, (596), 432 states have internal predecessors, (596), 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-01-09 05:01:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1129 transitions. [2025-01-09 05:01:36,312 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1129 transitions. Word has length 405 [2025-01-09 05:01:36,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:36,312 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1129 transitions. [2025-01-09 05:01:36,312 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-01-09 05:01:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1129 transitions. [2025-01-09 05:01:36,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-01-09 05:01:36,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:36,317 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] [2025-01-09 05:01:36,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:01:36,318 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:36,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:36,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1166431984, now seen corresponding path program 1 times [2025-01-09 05:01:36,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:36,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949566465] [2025-01-09 05:01:36,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:36,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:36,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-01-09 05:01:36,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-01-09 05:01:36,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:36,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6007 backedges. 125 proven. 55 refuted. 0 times theorem prover too weak. 5827 trivial. 0 not checked. [2025-01-09 05:01:37,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:37,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949566465] [2025-01-09 05:01:37,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949566465] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:37,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341358987] [2025-01-09 05:01:37,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:37,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:37,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:37,617 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-01-09 05:01:37,618 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-01-09 05:01:38,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-01-09 05:01:38,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-01-09 05:01:38,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:38,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:38,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 3170 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 05:01:38,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6007 backedges. 123 proven. 55 refuted. 0 times theorem prover too weak. 5829 trivial. 0 not checked. [2025-01-09 05:01:38,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:40,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6007 backedges. 125 proven. 55 refuted. 0 times theorem prover too weak. 5827 trivial. 0 not checked. [2025-01-09 05:01:40,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341358987] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:40,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:40,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-01-09 05:01:40,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513171067] [2025-01-09 05:01:40,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:40,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 05:01:40,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:40,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 05:01:40,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-01-09 05:01:40,034 INFO L87 Difference]: Start difference. First operand 710 states and 1129 transitions. Second operand has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 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-01-09 05:01:40,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:40,328 INFO L93 Difference]: Finished difference Result 1446 states and 2323 transitions. [2025-01-09 05:01:40,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 05:01:40,329 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 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 404 [2025-01-09 05:01:40,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:40,334 INFO L225 Difference]: With dead ends: 1446 [2025-01-09 05:01:40,335 INFO L226 Difference]: Without dead ends: 750 [2025-01-09 05:01:40,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 796 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-01-09 05:01:40,338 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 0 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:40,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2112 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:01:40,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-01-09 05:01:40,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 750. [2025-01-09 05:01:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 467 states have (on average 1.3618843683083512) internal successors, (636), 472 states have internal predecessors, (636), 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-01-09 05:01:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1169 transitions. [2025-01-09 05:01:40,378 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1169 transitions. Word has length 404 [2025-01-09 05:01:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:40,379 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1169 transitions. [2025-01-09 05:01:40,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 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-01-09 05:01:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1169 transitions. [2025-01-09 05:01:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-01-09 05:01:40,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:40,384 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-01-09 05:01:40,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:01:40,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:40,585 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:40,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1244097136, now seen corresponding path program 2 times [2025-01-09 05:01:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:40,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159445857] [2025-01-09 05:01:40,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:01:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:40,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 444 statements into 2 equivalence classes. [2025-01-09 05:01:42,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 444 of 444 statements. [2025-01-09 05:01:42,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 05:01:42,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7267 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7265 trivial. 0 not checked. [2025-01-09 05:01:43,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:43,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159445857] [2025-01-09 05:01:43,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159445857] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:43,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:43,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:01:43,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414556087] [2025-01-09 05:01:43,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:43,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:01:43,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:43,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:01:43,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:01:43,177 INFO L87 Difference]: Start difference. First operand 750 states and 1169 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-01-09 05:01:44,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:44,733 INFO L93 Difference]: Finished difference Result 785 states and 1216 transitions. [2025-01-09 05:01:44,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:01:44,734 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-01-09 05:01:44,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:44,739 INFO L225 Difference]: With dead ends: 785 [2025-01-09 05:01:44,739 INFO L226 Difference]: Without dead ends: 783 [2025-01-09 05:01:44,740 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-01-09 05:01:44,740 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 793 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:44,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1951 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 05:01:44,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-01-09 05:01:44,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 777. [2025-01-09 05:01:44,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 485 states have (on average 1.3567010309278351) internal successors, (658), 490 states have internal predecessors, (658), 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-01-09 05:01:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1208 transitions. [2025-01-09 05:01:44,812 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1208 transitions. Word has length 444 [2025-01-09 05:01:44,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:44,812 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1208 transitions. [2025-01-09 05:01:44,813 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-01-09 05:01:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1208 transitions. [2025-01-09 05:01:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-01-09 05:01:44,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:44,820 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-01-09 05:01:44,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:01:44,820 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:44,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:44,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1284464079, now seen corresponding path program 1 times [2025-01-09 05:01:44,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:44,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83084591] [2025-01-09 05:01:44,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:44,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:45,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-01-09 05:01:45,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-01-09 05:01:45,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:45,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 7273 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7269 trivial. 0 not checked. [2025-01-09 05:01:46,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:46,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83084591] [2025-01-09 05:01:46,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83084591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:46,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:46,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:01:46,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673166394] [2025-01-09 05:01:46,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:46,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:01:46,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:46,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:01:46,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:01:46,731 INFO L87 Difference]: Start difference. First operand 777 states and 1208 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-01-09 05:01:48,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:48,531 INFO L93 Difference]: Finished difference Result 786 states and 1215 transitions. [2025-01-09 05:01:48,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:01:48,531 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-01-09 05:01:48,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:48,537 INFO L225 Difference]: With dead ends: 786 [2025-01-09 05:01:48,538 INFO L226 Difference]: Without dead ends: 784 [2025-01-09 05:01:48,539 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-01-09 05:01:48,539 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 912 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:48,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 2044 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 05:01:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-01-09 05:01:48,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 781. [2025-01-09 05:01:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 488 states have (on average 1.3545081967213115) internal successors, (661), 493 states have internal predecessors, (661), 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-01-09 05:01:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1211 transitions. [2025-01-09 05:01:48,601 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1211 transitions. Word has length 449 [2025-01-09 05:01:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:48,602 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1211 transitions. [2025-01-09 05:01:48,603 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-01-09 05:01:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1211 transitions. [2025-01-09 05:01:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-01-09 05:01:48,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:48,608 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-01-09 05:01:48,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:01:48,608 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:48,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash 31025648, now seen corresponding path program 1 times [2025-01-09 05:01:48,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:48,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168742787] [2025-01-09 05:01:48,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:48,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-01-09 05:01:49,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-01-09 05:01:49,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:49,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7283 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7277 trivial. 0 not checked. [2025-01-09 05:01:50,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:50,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168742787] [2025-01-09 05:01:50,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168742787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:50,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:50,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:01:50,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896570197] [2025-01-09 05:01:50,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:50,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:01:50,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:50,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:01:50,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:01:50,318 INFO L87 Difference]: Start difference. First operand 781 states and 1211 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-01-09 05:01:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:51,734 INFO L93 Difference]: Finished difference Result 790 states and 1218 transitions. [2025-01-09 05:01:51,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:01:51,735 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-01-09 05:01:51,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:51,741 INFO L225 Difference]: With dead ends: 790 [2025-01-09 05:01:51,741 INFO L226 Difference]: Without dead ends: 788 [2025-01-09 05:01:51,742 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-01-09 05:01:51,742 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 597 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:51,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 2034 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 05:01:51,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-01-09 05:01:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 785. [2025-01-09 05:01:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 491 states have (on average 1.3523421588594704) internal successors, (664), 496 states have internal predecessors, (664), 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-01-09 05:01:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1214 transitions. [2025-01-09 05:01:51,790 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1214 transitions. Word has length 454 [2025-01-09 05:01:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:51,791 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1214 transitions. [2025-01-09 05:01:51,792 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-01-09 05:01:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1214 transitions. [2025-01-09 05:01:51,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-01-09 05:01:51,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:51,797 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-01-09 05:01:51,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:01:51,797 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:51,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:51,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1323284817, now seen corresponding path program 1 times [2025-01-09 05:01:51,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:51,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224015237] [2025-01-09 05:01:51,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:51,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:52,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 05:01:52,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 05:01:52,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:52,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7297 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7289 trivial. 0 not checked. [2025-01-09 05:01:53,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:53,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224015237] [2025-01-09 05:01:53,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224015237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:53,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:53,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:01:53,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580681820] [2025-01-09 05:01:53,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:53,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:01:53,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:53,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:01:53,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:01:53,584 INFO L87 Difference]: Start difference. First operand 785 states and 1214 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-01-09 05:01:54,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:54,957 INFO L93 Difference]: Finished difference Result 794 states and 1221 transitions. [2025-01-09 05:01:54,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:01:54,958 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-01-09 05:01:54,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:54,967 INFO L225 Difference]: With dead ends: 794 [2025-01-09 05:01:54,967 INFO L226 Difference]: Without dead ends: 792 [2025-01-09 05:01:54,968 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-01-09 05:01:54,968 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 790 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:54,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1958 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 05:01:54,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-01-09 05:01:55,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 789. [2025-01-09 05:01:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 494 states have (on average 1.3502024291497976) internal successors, (667), 499 states have internal predecessors, (667), 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-01-09 05:01:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1217 transitions. [2025-01-09 05:01:55,018 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1217 transitions. Word has length 459 [2025-01-09 05:01:55,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:55,020 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1217 transitions. [2025-01-09 05:01:55,020 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-01-09 05:01:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1217 transitions. [2025-01-09 05:01:55,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-01-09 05:01:55,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:55,025 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-01-09 05:01:55,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:01:55,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:55,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1441401264, now seen corresponding path program 1 times [2025-01-09 05:01:55,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:55,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56345536] [2025-01-09 05:01:55,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:55,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:55,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-01-09 05:01:55,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-01-09 05:01:55,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:55,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7305 trivial. 0 not checked. [2025-01-09 05:01:56,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:56,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56345536] [2025-01-09 05:01:56,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56345536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:56,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:56,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:01:56,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991778440] [2025-01-09 05:01:56,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:56,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:01:56,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:56,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:01:56,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:01:56,612 INFO L87 Difference]: Start difference. First operand 789 states and 1217 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-01-09 05:01:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:58,480 INFO L93 Difference]: Finished difference Result 798 states and 1224 transitions. [2025-01-09 05:01:58,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:01:58,480 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-01-09 05:01:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:58,490 INFO L225 Difference]: With dead ends: 798 [2025-01-09 05:01:58,491 INFO L226 Difference]: Without dead ends: 794 [2025-01-09 05:01:58,492 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-01-09 05:01:58,492 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 912 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:58,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 2034 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 05:01:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-01-09 05:01:58,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 791. [2025-01-09 05:01:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 496 states have (on average 1.346774193548387) internal successors, (668), 500 states have internal predecessors, (668), 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-01-09 05:01:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1218 transitions. [2025-01-09 05:01:58,581 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1218 transitions. Word has length 464 [2025-01-09 05:01:58,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:58,584 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1218 transitions. [2025-01-09 05:01:58,584 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-01-09 05:01:58,584 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1218 transitions. [2025-01-09 05:01:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-01-09 05:01:58,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:58,592 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-01-09 05:01:58,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:01:58,592 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:58,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash -156886927, now seen corresponding path program 1 times [2025-01-09 05:01:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:58,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449229231] [2025-01-09 05:01:58,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:58,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:58,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-01-09 05:01:59,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-01-09 05:01:59,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:59,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:59,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7337 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7325 trivial. 0 not checked. [2025-01-09 05:01:59,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:59,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449229231] [2025-01-09 05:01:59,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449229231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:59,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:59,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:01:59,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252936534] [2025-01-09 05:01:59,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:59,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:01:59,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:59,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:01:59,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:01:59,798 INFO L87 Difference]: Start difference. First operand 791 states and 1218 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-01-09 05:02:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:01,043 INFO L93 Difference]: Finished difference Result 794 states and 1220 transitions. [2025-01-09 05:02:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:02:01,043 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-01-09 05:02:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:01,047 INFO L225 Difference]: With dead ends: 794 [2025-01-09 05:02:01,047 INFO L226 Difference]: Without dead ends: 652 [2025-01-09 05:02:01,048 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-01-09 05:02:01,049 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 783 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:01,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1982 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 05:02:01,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-01-09 05:02:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 651. [2025-01-09 05:02:01,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 421 states have (on average 1.4038004750593824) internal successors, (591), 426 states have internal predecessors, (591), 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-01-09 05:02:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1022 transitions. [2025-01-09 05:02:01,090 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1022 transitions. Word has length 469 [2025-01-09 05:02:01,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:01,091 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 1022 transitions. [2025-01-09 05:02:01,091 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-01-09 05:02:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1022 transitions. [2025-01-09 05:02:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-01-09 05:02:01,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:01,095 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-01-09 05:02:01,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:02:01,095 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:01,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:01,096 INFO L85 PathProgramCache]: Analyzing trace with hash 367459243, now seen corresponding path program 1 times [2025-01-09 05:02:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:01,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689425561] [2025-01-09 05:02:01,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:01,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:01,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-09 05:02:01,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-09 05:02:01,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:01,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8187 trivial. 0 not checked. [2025-01-09 05:02:02,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:02,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689425561] [2025-01-09 05:02:02,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689425561] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:02,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093722822] [2025-01-09 05:02:02,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:02,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:02,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:02,618 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-01-09 05:02:02,619 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-01-09 05:02:03,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-09 05:02:04,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-09 05:02:04,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:04,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:04,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 4182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 05:02:04,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:02:04,763 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 21 treesize of output 20 [2025-01-09 05:02:04,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 05:02:04,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2025-01-09 05:02:05,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 05:02:05,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2025-01-09 05:02:05,185 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 1040 proven. 5 refuted. 0 times theorem prover too weak. 7147 trivial. 0 not checked. [2025-01-09 05:02:05,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:07,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8187 trivial. 0 not checked. [2025-01-09 05:02:07,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093722822] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:02:07,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:02:07,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2025-01-09 05:02:07,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787571016] [2025-01-09 05:02:07,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:07,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 05:02:07,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:07,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 05:02:07,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:02:07,099 INFO L87 Difference]: Start difference. First operand 651 states and 1022 transitions. Second operand has 10 states, 8 states have (on average 17.5) internal successors, (140), 10 states have internal predecessors, (140), 10 states have call successors, (119), 4 states have call predecessors, (119), 5 states have return successors, (118), 8 states have call predecessors, (118), 10 states have call successors, (118) [2025-01-09 05:02:11,173 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-01-09 05:02:15,184 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 []