./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_peterson.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_peterson.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a8be7009a37d1df58713fd67cd9771c39e6139a0416009824ceb58da10928b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:34:46,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:34:46,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:34:46,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:34:46,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:34:46,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:34:46,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:34:46,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:34:46,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:34:46,625 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:34:46,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:34:46,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:34:46,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:34:46,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:34:46,626 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:34:46,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:34:46,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:34:46,626 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:34:46,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:34:46,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:34:46,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:34:46,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:34:46,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:34:46,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:34:46,627 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:34:46,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:34:46,627 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:34:46,627 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:34:46,627 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:34:46,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:34:46,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:34:46,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:34:46,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:34:46,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:34:46,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:34:46,629 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:34:46,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:34:46,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:34:46,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:34:46,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:34:46,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:34:46,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:34:46,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:34:46,629 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a8be7009a37d1df58713fd67cd9771c39e6139a0416009824ceb58da10928b7 [2025-03-08 06:34:46,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:34:46,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:34:46,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:34:46,864 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:34:46,864 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:34:46,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_peterson.i [2025-03-08 06:34:48,012 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c59ac76a/c35c028c091549ff8084295c9d4132fc/FLAG8c9072698 [2025-03-08 06:34:48,292 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:34:48,296 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_peterson.i [2025-03-08 06:34:48,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c59ac76a/c35c028c091549ff8084295c9d4132fc/FLAG8c9072698 [2025-03-08 06:34:48,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c59ac76a/c35c028c091549ff8084295c9d4132fc [2025-03-08 06:34:48,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:34:48,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:34:48,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:34:48,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:34:48,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:34:48,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:34:48" (1/1) ... [2025-03-08 06:34:48,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b792325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:48, skipping insertion in model container [2025-03-08 06:34:48,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:34:48" (1/1) ... [2025-03-08 06:34:48,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:34:48,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_peterson.i[23605,23618] [2025-03-08 06:34:48,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:34:48,788 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:34:48,819 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_peterson.i[23605,23618] [2025-03-08 06:34:48,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:34:48,903 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:34:48,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:48 WrapperNode [2025-03-08 06:34:48,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:34:48,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:34:48,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:34:48,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:34:48,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:48" (1/1) ... [2025-03-08 06:34:48,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:48" (1/1) ... [2025-03-08 06:34:48,958 INFO L138 Inliner]: procedures = 145, calls = 285, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 437 [2025-03-08 06:34:48,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:34:48,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:34:48,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:34:48,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:34:48,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:48" (1/1) ... [2025-03-08 06:34:48,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:48" (1/1) ... [2025-03-08 06:34:48,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:48" (1/1) ... [2025-03-08 06:34:49,001 INFO L175 MemorySlicer]: Split 156 memory accesses to 18 slices as follows [2, 8, 8, 8, 13, 29, 0, 21, 7, 7, 7, 7, 13, 5, 5, 5, 5, 6]. 19 percent of accesses are in the largest equivalence class. The 43 initializations are split as follows [2, 3, 3, 3, 0, 9, 0, 9, 3, 3, 3, 3, 0, 0, 0, 0, 0, 2]. The 39 writes are split as follows [0, 2, 2, 2, 1, 11, 0, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 2]. [2025-03-08 06:34:49,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:48" (1/1) ... [2025-03-08 06:34:49,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:48" (1/1) ... [2025-03-08 06:34:49,032 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:48" (1/1) ... [2025-03-08 06:34:49,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:48" (1/1) ... [2025-03-08 06:34:49,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:48" (1/1) ... [2025-03-08 06:34:49,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:48" (1/1) ... [2025-03-08 06:34:49,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:34:49,050 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:34:49,050 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:34:49,050 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:34:49,051 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:48" (1/1) ... [2025-03-08 06:34:49,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:34:49,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:49,076 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:34:49,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:34:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 06:34:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 06:34:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 06:34:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 06:34:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 06:34:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 06:34:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 06:34:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 06:34:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 06:34:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 06:34:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 06:34:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 06:34:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 06:34:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 06:34:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 06:34:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 06:34:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 06:34:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 06:34:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 06:34:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 06:34:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 06:34:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 06:34:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 06:34:49,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 06:34:49,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 06:34:49,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 06:34:49,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 06:34:49,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 06:34:49,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 06:34:49,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 06:34:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 06:34:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 06:34:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 06:34:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 06:34:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 06:34:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 06:34:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 06:34:49,100 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 06:34:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:34:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 06:34:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 06:34:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 06:34:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 06:34:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 06:34:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 06:34:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 06:34:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 06:34:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-08 06:34:49,102 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 06:34:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-08 06:34:49,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:34:49,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-08 06:34:49,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 06:34:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 06:34:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 06:34:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 06:34:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 06:34:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 06:34:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 06:34:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 06:34:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:34:49,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:34:49,317 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:34:49,320 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:34:53,847 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-08 06:34:53,847 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:34:53,854 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:34:53,854 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:34:53,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:34:53 BoogieIcfgContainer [2025-03-08 06:34:53,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:34:53,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:34:53,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:34:53,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:34:53,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:34:48" (1/3) ... [2025-03-08 06:34:53,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba93338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:34:53, skipping insertion in model container [2025-03-08 06:34:53,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:48" (2/3) ... [2025-03-08 06:34:53,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba93338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:34:53, skipping insertion in model container [2025-03-08 06:34:53,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:34:53" (3/3) ... [2025-03-08 06:34:53,860 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_peterson.i [2025-03-08 06:34:53,869 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:34:53,870 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_peterson.i that has 6 procedures, 110 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 06:34:53,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:34:53,917 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;@5c88d657, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:34:53,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:34:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 70 states have internal predecessors, (90), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 06:34:53,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 06:34:53,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:53,932 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:34:53,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:53,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:53,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2104813846, now seen corresponding path program 1 times [2025-03-08 06:34:53,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:53,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555776648] [2025-03-08 06:34:53,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:53,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:54,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 06:34:54,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 06:34:54,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:54,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 06:34:54,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:54,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555776648] [2025-03-08 06:34:54,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555776648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:54,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:34:54,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:34:54,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980260346] [2025-03-08 06:34:54,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:54,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:34:54,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:54,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:34:54,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:34:54,562 INFO L87 Difference]: Start difference. First operand has 110 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 70 states have internal predecessors, (90), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 06:34:58,588 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-03-08 06:34:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:58,649 INFO L93 Difference]: Finished difference Result 218 states and 346 transitions. [2025-03-08 06:34:58,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:34:58,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-08 06:34:58,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:58,656 INFO L225 Difference]: With dead ends: 218 [2025-03-08 06:34:58,656 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 06:34:58,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:34:58,665 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 2 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:58,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 303 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 06:34:58,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 06:34:58,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-03-08 06:34:58,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 06:34:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2025-03-08 06:34:58,709 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 131 [2025-03-08 06:34:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:58,710 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2025-03-08 06:34:58,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 06:34:58,710 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2025-03-08 06:34:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:34:58,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:58,715 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:34:58,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:34:58,716 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:58,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:58,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1669982184, now seen corresponding path program 1 times [2025-03-08 06:34:58,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:58,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978838659] [2025-03-08 06:34:58,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:58,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:58,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:34:58,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:34:58,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:58,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 06:34:58,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:58,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978838659] [2025-03-08 06:34:58,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978838659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:58,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:34:58,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:34:58,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554594598] [2025-03-08 06:34:58,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:58,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:34:58,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:58,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:34:58,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:34:58,986 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 06:34:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:59,009 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2025-03-08 06:34:59,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:34:59,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2025-03-08 06:34:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:59,011 INFO L225 Difference]: With dead ends: 212 [2025-03-08 06:34:59,011 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 06:34:59,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:34:59,012 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:59,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:34:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 06:34:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-08 06:34:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 06:34:59,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2025-03-08 06:34:59,020 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 133 [2025-03-08 06:34:59,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:59,020 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2025-03-08 06:34:59,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 06:34:59,020 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2025-03-08 06:34:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 06:34:59,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:59,024 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:34:59,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:34:59,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:59,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:59,026 INFO L85 PathProgramCache]: Analyzing trace with hash 910353227, now seen corresponding path program 1 times [2025-03-08 06:34:59,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:59,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975144490] [2025-03-08 06:34:59,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:59,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:59,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:34:59,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:34:59,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:59,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 06:34:59,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:59,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975144490] [2025-03-08 06:34:59,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975144490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:34:59,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142748236] [2025-03-08 06:34:59,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:59,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:59,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:59,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:34:59,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:34:59,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:34:59,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:34:59,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:59,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:59,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:34:59,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:34:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 06:34:59,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:34:59,795 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 06:34:59,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142748236] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:34:59,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:34:59,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 06:34:59,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718155185] [2025-03-08 06:34:59,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:34:59,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:34:59,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:59,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:34:59,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:34:59,797 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 06:34:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:59,829 INFO L93 Difference]: Finished difference Result 215 states and 309 transitions. [2025-03-08 06:34:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:34:59,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 134 [2025-03-08 06:34:59,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:59,830 INFO L225 Difference]: With dead ends: 215 [2025-03-08 06:34:59,831 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 06:34:59,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:34:59,832 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 447 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-03-08 06:34:59,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 447 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:34:59,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 06:34:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-08 06:34:59,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 06:34:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2025-03-08 06:34:59,843 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 134 [2025-03-08 06:34:59,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:59,844 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2025-03-08 06:34:59,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 06:34:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2025-03-08 06:34:59,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 06:34:59,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:59,845 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:34:59,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:35:00,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:00,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:00,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:00,047 INFO L85 PathProgramCache]: Analyzing trace with hash 802572523, now seen corresponding path program 2 times [2025-03-08 06:35:00,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:00,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935177217] [2025-03-08 06:35:00,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:35:00,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:00,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-03-08 06:35:00,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 136 statements. [2025-03-08 06:35:00,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 06:35:00,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2025-03-08 06:35:00,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:00,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935177217] [2025-03-08 06:35:00,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935177217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:00,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:00,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:35:00,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878195562] [2025-03-08 06:35:00,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:00,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:35:00,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:00,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:35:00,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:35:00,292 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 06:35:00,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:00,329 INFO L93 Difference]: Finished difference Result 210 states and 303 transitions. [2025-03-08 06:35:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:35:00,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2025-03-08 06:35:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:00,332 INFO L225 Difference]: With dead ends: 210 [2025-03-08 06:35:00,332 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 06:35:00,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:00,333 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 97 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:00,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 472 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:35:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 06:35:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-08 06:35:00,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (51), 47 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-08 06:35:00,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 235 transitions. [2025-03-08 06:35:00,349 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 235 transitions. Word has length 136 [2025-03-08 06:35:00,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:00,349 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 235 transitions. [2025-03-08 06:35:00,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 06:35:00,349 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 235 transitions. [2025-03-08 06:35:00,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 06:35:00,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:00,352 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:35:00,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:35:00,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:00,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:00,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1968901276, now seen corresponding path program 1 times [2025-03-08 06:35:00,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:00,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419701552] [2025-03-08 06:35:00,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:00,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:00,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 06:35:00,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 06:35:00,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:00,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:00,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [2025-03-08 06:35:00,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:00,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419701552] [2025-03-08 06:35:00,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419701552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:00,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158455586] [2025-03-08 06:35:00,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:00,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:00,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:00,654 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:35:00,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:35:00,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 06:35:01,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 06:35:01,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:01,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:01,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 1453 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:35:01,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [2025-03-08 06:35:01,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [2025-03-08 06:35:01,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158455586] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:01,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:01,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 06:35:01,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934980782] [2025-03-08 06:35:01,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:01,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:35:01,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:01,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:35:01,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:35:01,370 INFO L87 Difference]: Start difference. First operand 164 states and 235 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2025-03-08 06:35:04,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:35:04,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:04,679 INFO L93 Difference]: Finished difference Result 330 states and 474 transitions. [2025-03-08 06:35:04,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:35:04,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) Word has length 205 [2025-03-08 06:35:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:04,682 INFO L225 Difference]: With dead ends: 330 [2025-03-08 06:35:04,682 INFO L226 Difference]: Without dead ends: 174 [2025-03-08 06:35:04,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 407 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:35:04,683 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 2 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:04,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 443 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-08 06:35:04,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-08 06:35:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-03-08 06:35:04,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (51), 47 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-08 06:35:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 247 transitions. [2025-03-08 06:35:04,703 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 247 transitions. Word has length 205 [2025-03-08 06:35:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:04,703 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 247 transitions. [2025-03-08 06:35:04,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2025-03-08 06:35:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 247 transitions. [2025-03-08 06:35:04,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 06:35:04,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:04,705 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:35:04,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:35:04,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:04,911 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:04,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:04,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1497019972, now seen corresponding path program 2 times [2025-03-08 06:35:04,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:04,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11323680] [2025-03-08 06:35:04,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:35:04,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:05,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 215 statements into 2 equivalence classes. [2025-03-08 06:35:05,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 215 statements. [2025-03-08 06:35:05,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 06:35:05,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2025-03-08 06:35:05,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:05,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11323680] [2025-03-08 06:35:05,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11323680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:05,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:05,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:35:05,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027316150] [2025-03-08 06:35:05,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:05,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:35:05,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:05,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:35:05,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:35:05,207 INFO L87 Difference]: Start difference. First operand 174 states and 247 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 06:35:06,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:06,720 INFO L93 Difference]: Finished difference Result 460 states and 661 transitions. [2025-03-08 06:35:06,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:35:06,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 215 [2025-03-08 06:35:06,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:06,723 INFO L225 Difference]: With dead ends: 460 [2025-03-08 06:35:06,723 INFO L226 Difference]: Without dead ends: 320 [2025-03-08 06:35:06,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:06,724 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 136 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:06,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 631 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 06:35:06,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-08 06:35:06,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 316. [2025-03-08 06:35:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 204 states have (on average 1.2794117647058822) internal successors, (261), 204 states have internal predecessors, (261), 91 states have call successors, (91), 20 states have call predecessors, (91), 20 states have return successors, (106), 91 states have call predecessors, (106), 91 states have call successors, (106) [2025-03-08 06:35:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 458 transitions. [2025-03-08 06:35:06,757 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 458 transitions. Word has length 215 [2025-03-08 06:35:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:06,757 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 458 transitions. [2025-03-08 06:35:06,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 06:35:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 458 transitions. [2025-03-08 06:35:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 06:35:06,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:06,760 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:35:06,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:35:06,760 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:06,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:06,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2074905990, now seen corresponding path program 1 times [2025-03-08 06:35:06,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:06,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019541985] [2025-03-08 06:35:06,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:06,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:06,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 06:35:06,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 06:35:06,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:06,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2025-03-08 06:35:07,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:07,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019541985] [2025-03-08 06:35:07,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019541985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:07,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:07,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:35:07,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070745046] [2025-03-08 06:35:07,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:07,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:35:07,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:07,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:35:07,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:35:07,488 INFO L87 Difference]: Start difference. First operand 316 states and 458 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 06:35:11,503 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-03-08 06:35:15,525 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-03-08 06:35:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:15,620 INFO L93 Difference]: Finished difference Result 578 states and 825 transitions. [2025-03-08 06:35:15,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:35:15,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 215 [2025-03-08 06:35:15,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:15,627 INFO L225 Difference]: With dead ends: 578 [2025-03-08 06:35:15,628 INFO L226 Difference]: Without dead ends: 290 [2025-03-08 06:35:15,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:15,633 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 132 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:15,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 635 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-03-08 06:35:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-08 06:35:15,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 286. [2025-03-08 06:35:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 185 states have (on average 1.2378378378378379) internal successors, (229), 185 states have internal predecessors, (229), 82 states have call successors, (82), 18 states have call predecessors, (82), 18 states have return successors, (90), 82 states have call predecessors, (90), 82 states have call successors, (90) [2025-03-08 06:35:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 401 transitions. [2025-03-08 06:35:15,657 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 401 transitions. Word has length 215 [2025-03-08 06:35:15,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:15,657 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 401 transitions. [2025-03-08 06:35:15,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 06:35:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 401 transitions. [2025-03-08 06:35:15,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 06:35:15,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:15,660 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:35:15,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:35:15,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:15,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:15,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1273261816, now seen corresponding path program 1 times [2025-03-08 06:35:15,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:15,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850516572] [2025-03-08 06:35:15,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:15,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:15,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 06:35:15,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 06:35:15,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:15,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2025-03-08 06:35:16,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:16,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850516572] [2025-03-08 06:35:16,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850516572] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:16,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452461142] [2025-03-08 06:35:16,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:16,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:16,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:16,201 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:35:16,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:35:16,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 06:35:16,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 06:35:16,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:16,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:16,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 1739 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 06:35:16,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 320 proven. 4 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2025-03-08 06:35:16,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2025-03-08 06:35:17,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452461142] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:17,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:17,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-08 06:35:17,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788528791] [2025-03-08 06:35:17,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:17,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:35:17,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:17,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:35:17,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:35:17,340 INFO L87 Difference]: Start difference. First operand 286 states and 401 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 9 states have call successors, (58), 5 states have call predecessors, (58), 6 states have return successors, (59), 7 states have call predecessors, (59), 9 states have call successors, (59) [2025-03-08 06:35:21,371 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-03-08 06:35:25,386 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-03-08 06:35:29,406 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-03-08 06:35:30,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:30,097 INFO L93 Difference]: Finished difference Result 574 states and 818 transitions. [2025-03-08 06:35:30,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:35:30,098 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 9 states have call successors, (58), 5 states have call predecessors, (58), 6 states have return successors, (59), 7 states have call predecessors, (59), 9 states have call successors, (59) Word has length 215 [2025-03-08 06:35:30,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:30,100 INFO L225 Difference]: With dead ends: 574 [2025-03-08 06:35:30,100 INFO L226 Difference]: Without dead ends: 312 [2025-03-08 06:35:30,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:35:30,102 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 135 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 73 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:30,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 713 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 610 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2025-03-08 06:35:30,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-08 06:35:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 309. [2025-03-08 06:35:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 207 states have internal predecessors, (258), 75 states have call successors, (75), 26 states have call predecessors, (75), 28 states have return successors, (95), 75 states have call predecessors, (95), 75 states have call successors, (95) [2025-03-08 06:35:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 428 transitions. [2025-03-08 06:35:30,123 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 428 transitions. Word has length 215 [2025-03-08 06:35:30,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:30,123 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 428 transitions. [2025-03-08 06:35:30,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 9 states have call successors, (58), 5 states have call predecessors, (58), 6 states have return successors, (59), 7 states have call predecessors, (59), 9 states have call successors, (59) [2025-03-08 06:35:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 428 transitions. [2025-03-08 06:35:30,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 06:35:30,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:30,126 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:35:30,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 06:35:30,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:30,327 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:30,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:30,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1306280632, now seen corresponding path program 1 times [2025-03-08 06:35:30,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:30,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185089455] [2025-03-08 06:35:30,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:30,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:30,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 06:35:30,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 06:35:30,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:30,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2025-03-08 06:35:31,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:31,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185089455] [2025-03-08 06:35:31,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185089455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:31,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399398183] [2025-03-08 06:35:31,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:31,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:31,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:32,000 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:35:32,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:35:32,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 06:35:32,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 06:35:32,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:32,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:32,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 1837 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 06:35:32,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:32,735 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 13 treesize of output 9 [2025-03-08 06:35:45,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 06:35:45,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 06:35:45,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2025-03-08 06:35:46,305 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2025-03-08 06:35:46,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104 [2025-03-08 06:36:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 365 proven. 4 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-03-08 06:36:05,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:36:05,382 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 25 treesize of output 23 [2025-03-08 06:36:05,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 31 [2025-03-08 06:36:05,906 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 20 treesize of output 18 [2025-03-08 06:36:05,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 22 [2025-03-08 06:36:05,972 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 20 treesize of output 18 [2025-03-08 06:36:05,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 22 [2025-03-08 06:36:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2025-03-08 06:36:06,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399398183] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:36:06,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:36:06,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 38 [2025-03-08 06:36:06,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764368450] [2025-03-08 06:36:06,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:36:06,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 06:36:06,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:36:06,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 06:36:06,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1257, Unknown=2, NotChecked=0, Total=1406 [2025-03-08 06:36:06,079 INFO L87 Difference]: Start difference. First operand 309 states and 428 transitions. Second operand has 38 states, 35 states have (on average 3.914285714285714) internal successors, (137), 35 states have internal predecessors, (137), 19 states have call successors, (68), 12 states have call predecessors, (68), 14 states have return successors, (68), 17 states have call predecessors, (68), 19 states have call successors, (68) [2025-03-08 06:36:07,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:36:11,770 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-03-08 06:36:15,777 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-03-08 06:36:20,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:36:24,679 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 []