./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_queue-2.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 8159433f4ea1208e9ded3d30d98c55f64500f74c12655a237b65d69e94898ea5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:52:12,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:52:12,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:52:12,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:52:12,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:52:12,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:52:12,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:52:12,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:52:12,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:52:12,155 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:52:12,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:52:12,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:52:12,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:52:12,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:52:12,156 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:52:12,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:52:12,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:52:12,157 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:52:12,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:52:12,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:52:12,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:52:12,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:52:12,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:52:12,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:52:12,157 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:52:12,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:52:12,157 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:52:12,157 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:52:12,158 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:52:12,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:52:12,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:52:12,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:52:12,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:52:12,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:52:12,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:52:12,158 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:52:12,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:52:12,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:52:12,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:52:12,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:52:12,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:52:12,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:52:12,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:52:12,158 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 -> 8159433f4ea1208e9ded3d30d98c55f64500f74c12655a237b65d69e94898ea5 [2025-02-05 16:52:12,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:52:12,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:52:12,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:52:12,427 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:52:12,427 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:52:12,428 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_queue-2.i [2025-02-05 16:52:13,665 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a20d64d4/bd2304a47fed452480e7aaa1e97ab1a4/FLAGbcd9ed318 [2025-02-05 16:52:14,014 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:52:14,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_queue-2.i [2025-02-05 16:52:14,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a20d64d4/bd2304a47fed452480e7aaa1e97ab1a4/FLAGbcd9ed318 [2025-02-05 16:52:14,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a20d64d4/bd2304a47fed452480e7aaa1e97ab1a4 [2025-02-05 16:52:14,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:52:14,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:52:14,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:52:14,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:52:14,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:52:14,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eaf004b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14, skipping insertion in model container [2025-02-05 16:52:14,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,094 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:52:14,456 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-2.i[34556,34569] [2025-02-05 16:52:14,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:52:14,593 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:52:14,635 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-2.i[34556,34569] [2025-02-05 16:52:14,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:52:14,763 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:52:14,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14 WrapperNode [2025-02-05 16:52:14,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:52:14,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:52:14,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:52:14,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:52:14,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,835 INFO L138 Inliner]: procedures = 249, calls = 626, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1331 [2025-02-05 16:52:14,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:52:14,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:52:14,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:52:14,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:52:14,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,910 INFO L175 MemorySlicer]: Split 386 memory accesses to 20 slices as follows [2, 8, 2, 8, 113, 8, 20, 12, 6, 83, 8, 46, 8, 4, 40, 8, 6, 2, 2, 0]. 29 percent of accesses are in the largest equivalence class. The 115 initializations are split as follows [2, 3, 0, 3, 46, 3, 6, 6, 0, 40, 2, 0, 2, 0, 0, 2, 0, 0, 0, 0]. The 85 writes are split as follows [0, 2, 0, 2, 33, 2, 8, 3, 0, 22, 4, 0, 4, 2, 0, 3, 0, 0, 0, 0]. [2025-02-05 16:52:14,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,949 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:14,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:52:14,993 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:52:14,993 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:52:14,993 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:52:14,994 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (1/1) ... [2025-02-05 16:52:15,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:52:15,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:15,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:52:15,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:52:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 16:52:15,054 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 16:52:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 16:52:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure empty [2025-02-05 16:52:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure empty [2025-02-05 16:52:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-02-05 16:52:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-02-05 16:52:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 16:52:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 16:52:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 16:52:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-05 16:52:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-05 16:52:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-05 16:52:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-05 16:52:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-05 16:52:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-05 16:52:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-05 16:52:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-05 16:52:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-05 16:52:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-05 16:52:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-05 16:52:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-05 16:52:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-05 16:52:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-05 16:52:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-05 16:52:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-05 16:52:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-05 16:52:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 16:52:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 16:52:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 16:52:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure enqueue [2025-02-05 16:52:15,059 INFO L138 BoogieDeclarations]: Found implementation of procedure enqueue [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-02-05 16:52:15,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 16:52:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-05 16:52:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-05 16:52:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-05 16:52:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-05 16:52:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-05 16:52:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-05 16:52:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-05 16:52:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-05 16:52:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-05 16:52:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-05 16:52:15,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-05 16:52:15,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-05 16:52:15,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-05 16:52:15,064 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:52:15,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-05 16:52:15,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 16:52:15,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:52:15,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:52:15,325 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:52:15,326 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:52:15,388 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L957: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-02-05 16:52:15,388 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L957: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,388 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L957-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,389 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L952: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-02-05 16:52:15,389 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L952: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,389 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L952-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,920 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-02-05 16:52:15,921 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,921 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1111-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1111-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1111-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1128-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1128-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1128-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1095-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1095-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1095-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1130-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1130-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1130-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);dequeue_#res#1 := 0; [2025-02-05 16:52:15,922 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1071-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-02-05 16:52:15,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1071-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1071-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1073-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-02-05 16:52:15,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1073-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1073-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1041-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-02-05 16:52:15,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1041-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,924 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1041-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,924 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-02-05 16:52:15,924 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,924 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:15,983 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L996: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-02-05 16:52:15,983 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L996: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:52:15,983 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:20,357 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2025-02-05 16:52:20,357 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:52:20,368 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:52:20,369 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:52:20,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:52:20 BoogieIcfgContainer [2025-02-05 16:52:20,369 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:52:20,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:52:20,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:52:20,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:52:20,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:52:14" (1/3) ... [2025-02-05 16:52:20,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b7e524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:52:20, skipping insertion in model container [2025-02-05 16:52:20,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:14" (2/3) ... [2025-02-05 16:52:20,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b7e524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:52:20, skipping insertion in model container [2025-02-05 16:52:20,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:52:20" (3/3) ... [2025-02-05 16:52:20,374 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_queue-2.i [2025-02-05 16:52:20,385 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:52:20,388 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_queue-2.i that has 10 procedures, 348 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 16:52:20,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:52:20,431 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;@7738099d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:52:20,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:52:20,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 348 states, 201 states have (on average 1.4676616915422886) internal successors, (295), 203 states have internal predecessors, (295), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-02-05 16:52:20,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-02-05 16:52:20,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:20,465 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] [2025-02-05 16:52:20,465 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:20,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:20,470 INFO L85 PathProgramCache]: Analyzing trace with hash -265943803, now seen corresponding path program 1 times [2025-02-05 16:52:20,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:20,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505655982] [2025-02-05 16:52:20,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:20,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:20,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-02-05 16:52:21,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-02-05 16:52:21,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:21,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2025-02-05 16:52:21,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:21,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505655982] [2025-02-05 16:52:21,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505655982] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:21,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120654226] [2025-02-05 16:52:21,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:21,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:21,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:21,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:21,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:52:22,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-02-05 16:52:22,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-02-05 16:52:22,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:22,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:22,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 1913 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 16:52:22,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2025-02-05 16:52:22,385 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:52:22,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120654226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:22,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:52:22,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 16:52:22,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480390718] [2025-02-05 16:52:22,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:22,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:52:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:22,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:52:22,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:52:22,409 INFO L87 Difference]: Start difference. First operand has 348 states, 201 states have (on average 1.4676616915422886) internal successors, (295), 203 states have internal predecessors, (295), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2025-02-05 16:52:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:22,470 INFO L93 Difference]: Finished difference Result 689 states and 1250 transitions. [2025-02-05 16:52:22,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:52:22,472 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) Word has length 322 [2025-02-05 16:52:22,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:22,481 INFO L225 Difference]: With dead ends: 689 [2025-02-05 16:52:22,482 INFO L226 Difference]: Without dead ends: 341 [2025-02-05 16:52:22,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:52:22,490 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:22,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:52:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-02-05 16:52:22,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-02-05 16:52:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 196 states have (on average 1.4540816326530612) internal successors, (285), 197 states have internal predecessors, (285), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-05 16:52:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 555 transitions. [2025-02-05 16:52:22,557 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 555 transitions. Word has length 322 [2025-02-05 16:52:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:22,557 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 555 transitions. [2025-02-05 16:52:22,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2025-02-05 16:52:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 555 transitions. [2025-02-05 16:52:22,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-02-05 16:52:22,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:22,563 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] [2025-02-05 16:52:22,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:52:22,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 16:52:22,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:22,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:22,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1525370833, now seen corresponding path program 1 times [2025-02-05 16:52:22,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:22,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755920552] [2025-02-05 16:52:22,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:22,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:23,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-02-05 16:52:23,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-02-05 16:52:23,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:23,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-02-05 16:52:24,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:24,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755920552] [2025-02-05 16:52:24,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755920552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:24,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:24,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:52:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117298909] [2025-02-05 16:52:24,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:24,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:52:24,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:24,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:52:24,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:52:24,136 INFO L87 Difference]: Start difference. First operand 341 states and 555 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-02-05 16:52:24,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:24,231 INFO L93 Difference]: Finished difference Result 678 states and 1112 transitions. [2025-02-05 16:52:24,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:52:24,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 322 [2025-02-05 16:52:24,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:24,243 INFO L225 Difference]: With dead ends: 678 [2025-02-05 16:52:24,243 INFO L226 Difference]: Without dead ends: 568 [2025-02-05 16:52:24,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:24,245 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 437 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:24,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1822 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:52:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-02-05 16:52:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2025-02-05 16:52:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 330 states have (on average 1.5303030303030303) internal successors, (505), 332 states have internal predecessors, (505), 217 states have call successors, (217), 18 states have call predecessors, (217), 18 states have return successors, (224), 217 states have call predecessors, (224), 217 states have call successors, (224) [2025-02-05 16:52:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 946 transitions. [2025-02-05 16:52:24,308 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 946 transitions. Word has length 322 [2025-02-05 16:52:24,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:24,308 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 946 transitions. [2025-02-05 16:52:24,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-02-05 16:52:24,308 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 946 transitions. [2025-02-05 16:52:24,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-02-05 16:52:24,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:24,317 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:24,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:52:24,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:24,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:24,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1590555158, now seen corresponding path program 1 times [2025-02-05 16:52:24,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:24,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445485181] [2025-02-05 16:52:24,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:24,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:24,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-02-05 16:52:24,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-02-05 16:52:24,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:24,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6434 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6434 trivial. 0 not checked. [2025-02-05 16:52:25,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:25,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445485181] [2025-02-05 16:52:25,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445485181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:25,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:25,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:52:25,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263183177] [2025-02-05 16:52:25,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:25,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:52:25,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:25,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:52:25,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:52:25,003 INFO L87 Difference]: Start difference. First operand 566 states and 946 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (61), 1 states have call predecessors, (61), 3 states have return successors, (61), 3 states have call predecessors, (61), 2 states have call successors, (61) [2025-02-05 16:52:25,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:25,056 INFO L93 Difference]: Finished difference Result 1124 states and 1884 transitions. [2025-02-05 16:52:25,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:52:25,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (61), 1 states have call predecessors, (61), 3 states have return successors, (61), 3 states have call predecessors, (61), 2 states have call successors, (61) Word has length 400 [2025-02-05 16:52:25,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:25,061 INFO L225 Difference]: With dead ends: 1124 [2025-02-05 16:52:25,061 INFO L226 Difference]: Without dead ends: 562 [2025-02-05 16:52:25,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:52:25,064 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 0 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:25,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1631 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:52:25,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-02-05 16:52:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2025-02-05 16:52:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 328 states have (on average 1.521341463414634) internal successors, (499), 330 states have internal predecessors, (499), 215 states have call successors, (215), 18 states have call predecessors, (215), 18 states have return successors, (222), 215 states have call predecessors, (222), 215 states have call successors, (222) [2025-02-05 16:52:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 936 transitions. [2025-02-05 16:52:25,097 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 936 transitions. Word has length 400 [2025-02-05 16:52:25,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:25,097 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 936 transitions. [2025-02-05 16:52:25,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (61), 1 states have call predecessors, (61), 3 states have return successors, (61), 3 states have call predecessors, (61), 2 states have call successors, (61) [2025-02-05 16:52:25,097 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 936 transitions. [2025-02-05 16:52:25,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-02-05 16:52:25,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:25,103 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:25,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:52:25,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:25,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:25,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1342090130, now seen corresponding path program 1 times [2025-02-05 16:52:25,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:25,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948644049] [2025-02-05 16:52:25,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:25,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-05 16:52:25,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-05 16:52:25,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:25,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6434 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6434 trivial. 0 not checked. [2025-02-05 16:52:26,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:26,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948644049] [2025-02-05 16:52:26,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948644049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:26,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:26,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:52:26,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647910500] [2025-02-05 16:52:26,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:26,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:52:26,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:26,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:52:26,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:26,326 INFO L87 Difference]: Start difference. First operand 562 states and 936 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) [2025-02-05 16:52:30,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:34,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:38,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:38,985 INFO L93 Difference]: Finished difference Result 1246 states and 2061 transitions. [2025-02-05 16:52:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:52:38,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) Word has length 401 [2025-02-05 16:52:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:39,000 INFO L225 Difference]: With dead ends: 1246 [2025-02-05 16:52:39,001 INFO L226 Difference]: Without dead ends: 1132 [2025-02-05 16:52:39,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:52:39,004 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 646 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 70 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:39,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 2051 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 115 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2025-02-05 16:52:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2025-02-05 16:52:39,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1125. [2025-02-05 16:52:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 656 states have (on average 1.5198170731707317) internal successors, (997), 663 states have internal predecessors, (997), 429 states have call successors, (429), 36 states have call predecessors, (429), 39 states have return successors, (459), 429 states have call predecessors, (459), 429 states have call successors, (459) [2025-02-05 16:52:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1885 transitions. [2025-02-05 16:52:39,175 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1885 transitions. Word has length 401 [2025-02-05 16:52:39,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:39,175 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1885 transitions. [2025-02-05 16:52:39,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) [2025-02-05 16:52:39,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1885 transitions. [2025-02-05 16:52:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-02-05 16:52:39,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:39,189 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:39,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:52:39,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:39,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:39,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1511083793, now seen corresponding path program 1 times [2025-02-05 16:52:39,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:39,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854873126] [2025-02-05 16:52:39,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:39,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:39,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-05 16:52:39,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-05 16:52:39,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:39,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6434 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6434 trivial. 0 not checked. [2025-02-05 16:52:40,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:40,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854873126] [2025-02-05 16:52:40,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854873126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:40,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:40,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:52:40,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068739625] [2025-02-05 16:52:40,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:40,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:52:40,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:40,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:52:40,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:40,128 INFO L87 Difference]: Start difference. First operand 1125 states and 1885 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) [2025-02-05 16:52:44,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:48,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:52,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:52,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:52,739 INFO L93 Difference]: Finished difference Result 2233 states and 3725 transitions. [2025-02-05 16:52:52,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:52:52,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) Word has length 401 [2025-02-05 16:52:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:52,748 INFO L225 Difference]: With dead ends: 2233 [2025-02-05 16:52:52,749 INFO L226 Difference]: Without dead ends: 1092 [2025-02-05 16:52:52,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:52:52,754 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 648 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 70 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:52,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 2052 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 115 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2025-02-05 16:52:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-02-05 16:52:52,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1088. [2025-02-05 16:52:52,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 636 states have (on average 1.5110062893081762) internal successors, (961), 643 states have internal predecessors, (961), 412 states have call successors, (412), 35 states have call predecessors, (412), 39 states have return successors, (436), 413 states have call predecessors, (436), 412 states have call successors, (436) [2025-02-05 16:52:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1809 transitions. [2025-02-05 16:52:52,825 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1809 transitions. Word has length 401 [2025-02-05 16:52:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:52,827 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1809 transitions. [2025-02-05 16:52:52,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) [2025-02-05 16:52:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1809 transitions. [2025-02-05 16:52:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-02-05 16:52:52,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:52,837 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:52,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:52:52,837 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:52,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:52,838 INFO L85 PathProgramCache]: Analyzing trace with hash -772791602, now seen corresponding path program 1 times [2025-02-05 16:52:52,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:52,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927584178] [2025-02-05 16:52:52,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:52,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:53,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-05 16:52:53,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-05 16:52:53,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:53,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:53,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6434 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6434 trivial. 0 not checked. [2025-02-05 16:52:53,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:53,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927584178] [2025-02-05 16:52:53,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927584178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:53,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:53,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:52:53,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394169381] [2025-02-05 16:52:53,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:53,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:52:53,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:53,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:52:53,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:53,751 INFO L87 Difference]: Start difference. First operand 1088 states and 1809 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) [2025-02-05 16:52:57,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:01,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:05,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:07,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:07,040 INFO L93 Difference]: Finished difference Result 1698 states and 2782 transitions. [2025-02-05 16:53:07,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:53:07,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) Word has length 401 [2025-02-05 16:53:07,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:07,047 INFO L225 Difference]: With dead ends: 1698 [2025-02-05 16:53:07,047 INFO L226 Difference]: Without dead ends: 1007 [2025-02-05 16:53:07,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:53:07,051 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 604 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 37 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:07,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1880 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 365 Invalid, 3 Unknown, 0 Unchecked, 13.1s Time] [2025-02-05 16:53:07,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2025-02-05 16:53:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 997. [2025-02-05 16:53:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 584 states have (on average 1.481164383561644) internal successors, (865), 589 states have internal predecessors, (865), 373 states have call successors, (373), 35 states have call predecessors, (373), 39 states have return successors, (396), 374 states have call predecessors, (396), 373 states have call successors, (396) [2025-02-05 16:53:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1634 transitions. [2025-02-05 16:53:07,131 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1634 transitions. Word has length 401 [2025-02-05 16:53:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:07,131 INFO L471 AbstractCegarLoop]: Abstraction has 997 states and 1634 transitions. [2025-02-05 16:53:07,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) [2025-02-05 16:53:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1634 transitions. [2025-02-05 16:53:07,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-02-05 16:53:07,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:07,137 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:07,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:53:07,138 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:07,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:07,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1069945708, now seen corresponding path program 1 times [2025-02-05 16:53:07,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:07,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511194229] [2025-02-05 16:53:07,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:07,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:07,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-02-05 16:53:07,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-02-05 16:53:07,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:07,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7220 trivial. 0 not checked. [2025-02-05 16:53:07,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:07,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511194229] [2025-02-05 16:53:07,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511194229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:07,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:07,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:53:07,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519782652] [2025-02-05 16:53:07,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:07,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:53:07,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:07,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:53:07,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:53:07,646 INFO L87 Difference]: Start difference. First operand 997 states and 1634 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (65), 1 states have call predecessors, (65), 3 states have return successors, (65), 3 states have call predecessors, (65), 2 states have call successors, (65) [2025-02-05 16:53:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:07,717 INFO L93 Difference]: Finished difference Result 1996 states and 3272 transitions. [2025-02-05 16:53:07,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:53:07,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (65), 1 states have call predecessors, (65), 3 states have return successors, (65), 3 states have call predecessors, (65), 2 states have call successors, (65) Word has length 439 [2025-02-05 16:53:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:07,724 INFO L225 Difference]: With dead ends: 1996 [2025-02-05 16:53:07,724 INFO L226 Difference]: Without dead ends: 1013 [2025-02-05 16:53:07,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:53:07,728 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 0 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:07,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1635 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:53:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-02-05 16:53:07,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1013. [2025-02-05 16:53:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 596 states have (on average 1.471476510067114) internal successors, (877), 601 states have internal predecessors, (877), 373 states have call successors, (373), 35 states have call predecessors, (373), 43 states have return successors, (403), 378 states have call predecessors, (403), 373 states have call successors, (403) [2025-02-05 16:53:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1653 transitions. [2025-02-05 16:53:07,786 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1653 transitions. Word has length 439 [2025-02-05 16:53:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:07,786 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1653 transitions. [2025-02-05 16:53:07,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (65), 1 states have call predecessors, (65), 3 states have return successors, (65), 3 states have call predecessors, (65), 2 states have call successors, (65) [2025-02-05 16:53:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1653 transitions. [2025-02-05 16:53:07,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-02-05 16:53:07,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:07,792 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:07,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:53:07,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:07,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:07,793 INFO L85 PathProgramCache]: Analyzing trace with hash 123511149, now seen corresponding path program 1 times [2025-02-05 16:53:07,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:07,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815063156] [2025-02-05 16:53:07,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:07,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:08,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-02-05 16:53:08,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-02-05 16:53:08,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:08,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7789 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7789 trivial. 0 not checked. [2025-02-05 16:53:08,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:08,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815063156] [2025-02-05 16:53:08,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815063156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:08,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:08,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:53:08,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584783090] [2025-02-05 16:53:08,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:08,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:53:08,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:08,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:53:08,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:53:08,613 INFO L87 Difference]: Start difference. First operand 1013 states and 1653 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-02-05 16:53:12,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:16,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:16,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:16,770 INFO L93 Difference]: Finished difference Result 1506 states and 2410 transitions. [2025-02-05 16:53:16,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:53:16,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 462 [2025-02-05 16:53:16,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:16,777 INFO L225 Difference]: With dead ends: 1506 [2025-02-05 16:53:16,777 INFO L226 Difference]: Without dead ends: 1009 [2025-02-05 16:53:16,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:53:16,780 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 448 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:16,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1703 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-02-05 16:53:16,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-02-05 16:53:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1002. [2025-02-05 16:53:16,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 588 states have (on average 1.4710884353741496) internal successors, (865), 592 states have internal predecessors, (865), 371 states have call successors, (371), 35 states have call predecessors, (371), 42 states have return successors, (399), 376 states have call predecessors, (399), 371 states have call successors, (399) [2025-02-05 16:53:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1635 transitions. [2025-02-05 16:53:16,831 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1635 transitions. Word has length 462 [2025-02-05 16:53:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:16,831 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1635 transitions. [2025-02-05 16:53:16,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-02-05 16:53:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1635 transitions. [2025-02-05 16:53:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-02-05 16:53:16,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:16,838 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:16,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:53:16,838 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:16,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:16,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1597789292, now seen corresponding path program 1 times [2025-02-05 16:53:16,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:16,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520101497] [2025-02-05 16:53:16,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:16,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:17,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-02-05 16:53:17,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-02-05 16:53:17,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:17,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7789 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7789 trivial. 0 not checked. [2025-02-05 16:53:17,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:17,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520101497] [2025-02-05 16:53:17,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520101497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:17,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:17,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:53:17,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217857896] [2025-02-05 16:53:17,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:17,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:53:17,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:17,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:53:17,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:53:17,632 INFO L87 Difference]: Start difference. First operand 1002 states and 1635 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-02-05 16:53:21,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:25,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:25,783 INFO L93 Difference]: Finished difference Result 1452 states and 2323 transitions. [2025-02-05 16:53:25,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:53:25,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 462 [2025-02-05 16:53:25,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:25,790 INFO L225 Difference]: With dead ends: 1452 [2025-02-05 16:53:25,790 INFO L226 Difference]: Without dead ends: 946 [2025-02-05 16:53:25,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:53:25,792 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 444 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:25,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1706 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-02-05 16:53:25,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-02-05 16:53:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 939. [2025-02-05 16:53:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 548 states have (on average 1.4197080291970803) internal successors, (778), 551 states have internal predecessors, (778), 352 states have call successors, (352), 33 states have call predecessors, (352), 38 states have return successors, (376), 356 states have call predecessors, (376), 352 states have call successors, (376) [2025-02-05 16:53:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1506 transitions. [2025-02-05 16:53:25,839 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1506 transitions. Word has length 462 [2025-02-05 16:53:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:25,839 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1506 transitions. [2025-02-05 16:53:25,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-02-05 16:53:25,840 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1506 transitions. [2025-02-05 16:53:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-02-05 16:53:25,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:25,846 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:25,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:53:25,846 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:25,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:25,846 INFO L85 PathProgramCache]: Analyzing trace with hash -661878739, now seen corresponding path program 1 times [2025-02-05 16:53:25,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:25,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8537576] [2025-02-05 16:53:25,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:25,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:26,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-02-05 16:53:26,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-02-05 16:53:26,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:26,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7789 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 7744 trivial. 0 not checked. [2025-02-05 16:53:27,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:27,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8537576] [2025-02-05 16:53:27,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8537576] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:53:27,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40639188] [2025-02-05 16:53:27,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:27,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:27,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:27,599 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:53:27,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:53:28,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-02-05 16:53:28,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-02-05 16:53:28,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:28,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:28,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 2458 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 16:53:28,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:53:28,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 16:53:28,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 16:53:28,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 16:53:28,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 16:53:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7789 backedges. 2080 proven. 0 refuted. 0 times theorem prover too weak. 5709 trivial. 0 not checked. [2025-02-05 16:53:28,852 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:53:28,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40639188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:28,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:53:28,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 16:53:28,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388302252] [2025-02-05 16:53:28,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:28,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:53:28,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:28,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:53:28,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:53:28,854 INFO L87 Difference]: Start difference. First operand 939 states and 1506 transitions. Second operand has 5 states, 4 states have (on average 25.75) internal successors, (103), 5 states have internal predecessors, (103), 4 states have call successors, (67), 2 states have call predecessors, (67), 3 states have return successors, (67), 3 states have call predecessors, (67), 4 states have call successors, (67) [2025-02-05 16:53:32,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:36,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:38,364 INFO L93 Difference]: Finished difference Result 1064 states and 1681 transitions. [2025-02-05 16:53:38,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:53:38,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.75) internal successors, (103), 5 states have internal predecessors, (103), 4 states have call successors, (67), 2 states have call predecessors, (67), 3 states have return successors, (67), 3 states have call predecessors, (67), 4 states have call successors, (67) Word has length 462 [2025-02-05 16:53:38,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:38,371 INFO L225 Difference]: With dead ends: 1064 [2025-02-05 16:53:38,371 INFO L226 Difference]: Without dead ends: 795 [2025-02-05 16:53:38,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:53:38,373 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 529 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 45 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:38,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 2253 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 401 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2025-02-05 16:53:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-02-05 16:53:38,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 789. [2025-02-05 16:53:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 461 states have (on average 1.4143167028199566) internal successors, (652), 465 states have internal predecessors, (652), 296 states have call successors, (296), 27 states have call predecessors, (296), 31 states have return successors, (316), 298 states have call predecessors, (316), 296 states have call successors, (316) [2025-02-05 16:53:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1264 transitions. [2025-02-05 16:53:38,420 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1264 transitions. Word has length 462 [2025-02-05 16:53:38,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:38,420 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1264 transitions. [2025-02-05 16:53:38,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.75) internal successors, (103), 5 states have internal predecessors, (103), 4 states have call successors, (67), 2 states have call predecessors, (67), 3 states have return successors, (67), 3 states have call predecessors, (67), 4 states have call successors, (67) [2025-02-05 16:53:38,421 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1264 transitions. [2025-02-05 16:53:38,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-05 16:53:38,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:38,425 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 11, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:38,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:53:38,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:38,626 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:38,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:38,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1358655115, now seen corresponding path program 1 times [2025-02-05 16:53:38,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:38,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495050194] [2025-02-05 16:53:38,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:38,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:38,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-05 16:53:39,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-05 16:53:39,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:39,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8091 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8087 trivial. 0 not checked. [2025-02-05 16:53:39,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:39,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495050194] [2025-02-05 16:53:39,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495050194] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:53:39,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637406499] [2025-02-05 16:53:39,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:39,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:39,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:39,813 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:53:39,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:53:40,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-05 16:53:41,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-05 16:53:41,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:41,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:41,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 2690 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-05 16:53:41,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:53:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8091 backedges. 1956 proven. 12 refuted. 0 times theorem prover too weak. 6123 trivial. 0 not checked. [2025-02-05 16:53:42,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:53:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8091 backedges. 75 proven. 55 refuted. 0 times theorem prover too weak. 7961 trivial. 0 not checked. [2025-02-05 16:53:44,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637406499] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:53:44,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:53:44,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 22 [2025-02-05 16:53:44,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554589968] [2025-02-05 16:53:44,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:53:44,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 16:53:44,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:44,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 16:53:44,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:53:44,851 INFO L87 Difference]: Start difference. First operand 789 states and 1264 transitions. Second operand has 22 states, 20 states have (on average 8.95) internal successors, (179), 20 states have internal predecessors, (179), 14 states have call successors, (158), 8 states have call predecessors, (158), 11 states have return successors, (158), 15 states have call predecessors, (158), 14 states have call successors, (158)